1. On colour-preserving automorphisms of Cayley graphsAdemir Hujdurović, Klavdija Kutnar, Dave Witte Morris, Joy Morris, 2016, original scientific article Abstract: 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. Keywords: Cayley graph, automorphism, colour-preserving, colour-permuting Published in RUP: 03.01.2022; Views: 784; Downloads: 18 Full text (412,93 KB) |
2. |
3. |
4. |
5. |
6. |
7. |
8. Hamiltonian cycles in Cayley graphs whose order has few prime factorsKlavdija Kutnar, Dragan Marušič, D. W. Morris, Joy Morris, Primož Šparl, 2012, original scientific article Abstract: We prove that if Cay▫$(G; S)$▫ is a connected Cayley graph with ▫$n$▫ vertices, and the prime factorization of ▫$n$▫ is very small, then Cay▫$(G; S)$▫ has a hamiltonian cycle. More precisely, if ▫$p$▫, ▫$q$▫, and ▫$r$▫ are distinct primes, then ▫$n$▫ can be of the form kp with ▫$24 \ne k < 32$▫, or of the form ▫$kpq$▫ with ▫$k \le 5$▫, or of the form ▫$pqr$▫, or of the form ▫$kp^2$▫ with ▫$k \le 4$▫, or of the form ▫$kp^3$▫ with ▫$k \le 2$▫. Keywords: graph theory, Cayley graphs, hamiltonian cycles Published in RUP: 15.10.2013; Views: 3547; Downloads: 121 Full text (545,91 KB) |
9. |