Two-geodesic transitive graphs of order $p^n$ with $n\leq3$
Jun-Jie Huang, Yan-Quan Feng, Jin-Xin Zhou, Fu-Gang Yin

TL;DR
This paper classifies all 2-geodesic transitive graphs of order p^n for primes p and n ≤ 3, revealing a small set of specific graphs and infinite families with detailed structural properties.
Contribution
It provides a complete classification of 2-geodesic transitive graphs of order p^n for n ≤ 3, including explicit descriptions of all such graphs and families.
Findings
Identifies three small graphs: K_{4,4}, the Schl"afli graph, and its complement.
Describes fourteen infinite families, including cycles, complete graphs, multipartite graphs, and Hamming graphs.
Includes two infinite families of normal Cayley graphs on extraspecial groups.
Abstract
A vertex triple of a graph is called a -geodesic if is adjacent to both and and is not adjacent to . A graph is said to be -geodesic transitive if its automorphism group is transitive on the set of -geodesics. In this paper, a complete classification of -geodesic transitive graphs of order is given for each prime and . It turns out that all such graphs consist of three small graphs: the complete bipartite graph of order , the Schl\"{a}fli graph of order and its complement, and fourteen infinite families: the cycles and , the complete graphs and , the complete multipartite graphs , and , the Hamming graph and its complement, the Hamming graph , and two infinite families of normal Cayley graphs on extraspecial…
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 · Advanced Graph Theory Research · Geometric and Algebraic Topology
