Finite cubic graphs admitting a cyclic group of automorphism with at most three orbits on vertices
From MaRDI portal
Publication:2214042
DOI10.1016/j.disc.2020.112195zbMath1453.05047arXiv2003.05186OpenAlexW3093704291MaRDI QIDQ2214042
Primož Potočnik, Micael Toledo
Publication date: 4 December 2020
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2003.05186
Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Related Items
Generalised voltage graphs ⋮ Cubic vertex-transitive graphs admitting automorphisms of large order ⋮ On orders of automorphisms of vertex-transitive graphs
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Classification of cubic symmetric tetracirculants and pentacirculants
- Elementary abelian covers of graphs
- A classification of cubic bicirculants
- On vertex symmetric digraphs
- Cyclic Haar graphs
- Lifting graph automorphisms by voltage assignments
- On certain edge-transitive bicirculants
- The number of spanning trees in circulant graphs, its arithmetic properties and asymptotic
- On embeddings of circulant graphs
- Cubic arc-transitive \(k\)-multicirculants
- Stability of circulant graphs
- Symmetric cubic graphs of small girth
- Semiregular elements in cubic vertex-transitive graphs and the restricted Burnside problem
- Characterization of edge-transitive 4-valent bicirculants
- Transitive Permutation Groups Without Semiregular Subgroups
- Classification of cubic vertex-transitive tricirculants
- A Construction for Vertex-Transitive Graphs
- Girth-regular graphs
- Coverings of graphs and maps, orthogonality, and eigenvectors
This page was built for publication: Finite cubic graphs admitting a cyclic group of automorphism with at most three orbits on vertices