Finite cubic graphs admitting a cyclic group of automorphism with at most three orbits on vertices
From MaRDI portal
Publication:2214042
Abstract: The theory of voltage graphs has become a standard tool in the study graphs admitting a semiregular group of automorphisms. We introduce the notion of a cyclic generalised voltage graph to extend the scope of this theory to graphs admitting a cyclic group of automorphism that may not be semiregular. We use this new tool to classify all cubic graphs admitting a cyclic group of automorphisms with at most three vertex-orbits and we characterise vertextransitivity for each of these classes. In particular, we show that a cubic vertex-transitive graph admitting a cyclic group of automorphisms with at most three orbits on vertices either belongs to one of 5 infinite families or is isomorphic to the well-know Tutte-Coxeter graph.
Recommendations
- Semiregular automorphisms of cubic vertex-transitive graphs and the abelian normal quotient method
- A refined classification of symmetric cubic graphs
- Cubic vertex-transitive graphs admitting automorphisms of large order
- Classification of cubic vertex-transitive tricirculants
- Groups of automorphisms of finite regular cubic graphs
Cites work
- scientific article; zbMATH DE number 4164916 (Why is no real title available?)
- scientific article; zbMATH DE number 4006288 (Why is no real title available?)
- scientific article; zbMATH DE number 5244599 (Why is no real title available?)
- A Construction for Vertex-Transitive Graphs
- A classification of cubic bicirculants
- Characterization of edge-transitive 4-valent bicirculants
- Classification of cubic symmetric tetracirculants and pentacirculants
- Classification of cubic vertex-transitive tricirculants
- Coverings of graphs and maps, orthogonality, and eigenvectors
- Cubic arc-transitive \(k\)-multicirculants
- Cyclic Haar graphs
- Elementary abelian covers of graphs
- Girth-regular graphs
- Lifting graph automorphisms by voltage assignments
- On certain edge-transitive bicirculants
- On embeddings of circulant graphs
- On vertex symmetric digraphs
- Semiregular elements in cubic vertex-transitive graphs and the restricted Burnside problem
- Stability of circulant graphs
- Symmetric cubic graphs of small girth
- The number of spanning trees in circulant graphs, its arithmetic properties and asymptotic
- Transitive Permutation Groups Without Semiregular Subgroups
Cited in
(5)- scientific article; zbMATH DE number 4021178 (Why is no real title available?)
- scientific article; zbMATH DE number 38311 (Why is no real title available?)
- Generalised voltage graphs
- On orders of automorphisms of vertex-transitive graphs
- Cubic vertex-transitive graphs admitting automorphisms of large order
This page was built for publication: Finite cubic graphs admitting a cyclic group of automorphism with at most three orbits on vertices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2214042)