1. On cubic vertex-transitive graphs of given girthEdward Tauscher Dobson, Ademir Hujdurović, Wilfried Imrich, Ronald Ortner, 2025, izvirni znanstveni članek Opis: A set of vertices of a graph is distinguishing if the only automorphism that preserves it is the identity. The minimal size of such sets, if they exist, is the distinguishing cost. The distinguishing costs of vertex transitive cubic graphs are well known if they are 1-arc-transitive, or if they have two edge orbits and either have girth 3 or vertex-stabilizers of order 1 or 2. There are many results about vertex-transitive cubic graphs of girth 4 with two edge orbits, but for larger girth almost nothing is known about the distinguishing costs of such graphs. We prove that cubic vertex-transitive graphs of girth 5 with two edge orbits have distinguishing cost 2, and prove the non-existence of infinite 3-arc-transitive cubic graphs of girth 6.
Ključne besede: distinguishing number, distinguishing cost, vertex-transitive cubic graphs, automorphisms
Objavljeno v RUP: 27.08.2025; Ogledov: 704; Prenosov: 4
 Celotno besedilo (451,52 KB)
Gradivo ima več datotek! Več... |
2. |
3. |
4. |
5. |
6. |
7. |
8. |
9. On colour-preserving automorphisms of Cayley graphsAdemir Hujdurović, Klavdija Kutnar, Dave Witte Morris, Joy Morris, 2016, izvirni znanstveni članek Opis: We study the automorphisms of a Cayley graph that preserve its natural edge-colouring. More precisely, we are interested in groups ▫$G$▫, such that every such automorphism of every connected Cayley graph on ▫$G$▫ has a very simple form: the composition of a left-translation and a group automorphism. We find classes of groups that have the property, and we determine the orders of all groups that do not have the property. We also have analogous results for automorphisms that permute the colours, rather than preserving them.
Ključne besede: Cayley graph, automorphism, colour-preserving, colour-permuting
Objavljeno v RUP: 03.01.2022; Ogledov: 2249; Prenosov: 35
Celotno besedilo (412,93 KB) |
10. |
