Finite cubic graphs admitting a cyclic group of automorphism with at most three orbits on vertices

DOI10.1016/J.DISC.2020.112195zbMATH Open1453.05047arXiv2003.05186OpenAlexW3093704291MaRDI QIDQ2214042FDOQ2214042

Authors: Primož Potočnik, Micael Toledo 

Publication date: 4 December 2020

Published in: Discrete Mathematics (Search for Journal in Brave)

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.

Full work available at URL: https://arxiv.org/abs/2003.05186

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

zbMATH Keywords

cubic graphvertex-transitivecyclic groupvoltage graphfew orbits

Mathematics Subject Classification ID

Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25)

Cites Work

• Title not available (Why is that?)
• Transitive Permutation Groups Without Semiregular Subgroups
• Lifting graph automorphisms by voltage assignments
• Elementary abelian covers of graphs
• On vertex symmetric digraphs
• Cyclic Haar graphs
• A classification of cubic bicirculants
• Classification of cubic symmetric tetracirculants and pentacirculants
• A Construction for Vertex-Transitive Graphs
• Classification of cubic vertex-transitive tricirculants
• Title not available (Why is that?)
• Symmetric cubic graphs of small girth
• Characterization of edge-transitive 4-valent bicirculants
• Coverings of graphs and maps, orthogonality, and eigenvectors
• Title not available (Why is that?)
• Stability of circulant graphs
• Semiregular elements in cubic vertex-transitive graphs and the restricted Burnside problem
• On embeddings of circulant graphs
• On certain edge-transitive bicirculants
• Cubic arc-transitive \(k\)-multicirculants
• The number of spanning trees in circulant graphs, its arithmetic properties and asymptotic
• Girth-regular graphs

Cited In (5)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Generalised voltage graphs
• On orders of automorphisms of vertex-transitive graphs
• Cubic vertex-transitive graphs admitting automorphisms of large order

Uses Software

• SageMath

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)