Cubic arc-transitive $k$-circulants
Michael Giudici, Istv\'an Kov\'acs, Cai Heng Li, Gabriel Verret

TL;DR
This paper investigates cubic arc-transitive k-circulant graphs, proving the existence of infinitely many for even k and establishing an order bound for odd k under certain conditions, advancing understanding of symmetric graph structures.
Contribution
It proves the existence of infinitely many cubic arc-transitive k-circulants for even k and confirms a conjecture on order bounds for odd k when k is squarefree and coprime to 6.
Findings
Infinitely many cubic arc-transitive k-circulants exist for even k.
A conjecture on order bounds for odd k is proven for squarefree, coprime to 6 k.
The paper advances classification of symmetric graphs with cyclic automorphism groups.
Abstract
For an integer , a graph is called a -circulant if its automorphism group contains a cyclic semiregular subgroup with orbits on the vertices. We show that, if is even, there exist infinitely many cubic arc-transitive -circulants. We conjecture that, if is odd, then a cubic arc-transitive -circulant has order at most . Our main result is a proof of this conjecture when is squarefree and coprime to .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsFinite Group Theory Research · Coding theory and cryptography · graph theory and CDMA systems
