Morris, Davehttps://hdl.handle.net/10133/52462021-11-30T20:36:39Z2021-11-30T20:36:39ZHamiltonian cycles in Caley graphs whose order has few prime factorsKutnar, KlavdijaMarusic, DraganMorris, Dave WitteMorris, JoySparl, Primozhttps://hdl.handle.net/10133/51642018-07-10T19:31:32Z2012-01-01T00:00:00ZHamiltonian cycles in Caley graphs whose order has few prime factors
Kutnar, Klavdija; Marusic, Dragan; Morris, Dave Witte; Morris, Joy; Sparl, Primoz
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 6= k < 32, or of the form kpq with k ≤ 5,or of the form pqr,or of the form kp2 with k ≤ 4,or of the form kp3 with k ≤ 2.
Open access, licensed under Creative Commons
2012-01-01T00:00:00ZCaley graphs of order 16p are hamiltonianCurran, Stephen J.Morris, Dave WitteMorris, Joyhttps://hdl.handle.net/10133/51632018-07-10T18:27:14Z2012-01-01T00:00:00ZCaley graphs of order 16p are hamiltonian
Curran, Stephen J.; Morris, Dave Witte; Morris, Joy
Suppose G is a ﬁnite group, such that |G| = 16p, where p is prime. We show that if S is any generating set of G, then there is a hamiltonian cycle in the corresponding Cayley graph Cay(G;S).
Open access, licensed under Creative Commons
2012-01-01T00:00:00ZOn colour-preserving automorphisms of Caley graphsHujdurovic, AdemirKutnar, KlavdijaMorris, Dave WitteMorris, Joyhttps://hdl.handle.net/10133/51612018-07-10T19:45:20Z2016-01-01T00:00:00ZOn colour-preserving automorphisms of Caley graphs
Hujdurovic, Ademir; Kutnar, Klavdija; Morris, Dave Witte; Morris, Joy
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 ﬁnd 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.
Open access, licensed under Creative Commons
2016-01-01T00:00:00Z