1. Groups with elements of order 8 do not have the DCI propertyTed Dobson, Joy Morris, Pablo Spiga, 2025, izvirni znanstveni članek Opis: Let k be odd, and n an odd multiple of 3. Although this can also be deduced from known results, we provide a new proof that Ck ⋊ C₈ and (Cn × C₃) ⋊ C₈ do not have the Directed Cayley Isomorphism (DCI) property. When k is prime, Ck ⋊ C₈ had previously been proved to have the Cayley Isomorphism (CI) property. To the best of our knowledge, the groups Cp ⋊ C₈ (where p is an odd prime) are only the second known infinite family of groups that have the CI property but do not have the DCI property. This also provides a new proof of the result (which follows from known results but was not explicitly published) that no group with an element of order 8 has the DCI property.
One piece of our proof is a new result that may prove to be of independent interest: we show that if a permutation group has a regular subgroup of index 2 then it must be 2-closed.
Ključne besede: CI property, DCI property, Cayley graphs, Cayley digraphs, 2-closed groups, 2-closure
Objavljeno v RUP: 03.11.2025; Ogledov: 259; Prenosov: 1
 Celotno besedilo (344,18 KB) |
2. |
3. 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: 2232; Prenosov: 35
Celotno besedilo (412,93 KB) |
4. |
5. |
6. |
7. |
8. |
9. |
10. Hamiltonian cycles in Cayley graphs whose order has few prime factorsKlavdija Kutnar, Dragan Marušič, D. W. Morris, Joy Morris, Primož Šparl, 2012, izvirni znanstveni članek Opis: 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$▫.
Ključne besede: graph theory, Cayley graphs, hamiltonian cycles
Objavljeno v RUP: 15.10.2013; Ogledov: 5501; Prenosov: 129
Celotno besedilo (545,91 KB) |
