Projects per year
Abstract
A Cayley graph for a group G is CCA if every automorphism of the graph that preserves the edge-orbits under the regular representation of G is an element of the normaliser of G. A group G is then said to be CCA if every connected Cayley graph on G is CCA. We show that a finite simple group is CCA if and only if it has no element of order 4. We also show that “many” 2-groups are non-CCA.
Original language | English |
---|---|
Pages (from-to) | 318-333 |
Number of pages | 16 |
Journal | Journal of Algebra |
Volume | 569 |
DOIs | |
Publication status | Published - 1 Mar 2021 |
Fingerprint
Dive into the research topics of 'A finite simple group is CCA if and only if it has no element of order four'. Together they form a unique fingerprint.Projects
- 2 Finished
-
Structure theory for permutation groups and local graph theory conjectures
ARC Australian Research Council
1/01/16 → 31/01/19
Project: Research
-
Enumeration of Vertex Transitive Graphs
Verret, G.
ARC Australian Research Council
1/01/13 → 10/02/16
Project: Research