Two-distance transitive normal Cayley graphs
Jun-Jie Huang, Yan-Quan Feng, Jin-Xin Zhou

TL;DR
This paper constructs an infinite family of normal Cayley graphs that are 2-distance-transitive but not distance- or 2-arc-transitive, addressing a previously open question and correcting earlier literature claims.
Contribution
It introduces a new infinite family of normal Cayley graphs with specific transitivity properties, resolving an open problem and correcting prior misconceptions.
Findings
Constructed an infinite family of such graphs.
Demonstrated these graphs are 2-distance-transitive.
Showed these graphs are not distance- or 2-arc-transitive.
Abstract
In this paper, we construct an infinite family of normal Cayley graphs, which are -distance-transitive but neither distance-transitive nor -arc-transitive. This answers a question raised by Chen, Jin and Li in 2019 and corrects a claim in a literature given by Pan, Huang and Liu in 2015.
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 · Interconnection Networks and Systems · Nanocluster Synthesis and Applications
