A note on the degree-diameter problem for arc-transitive graphs
Abstract
We give two lower bounds on the largest order of an arc-transitive graph of diameter two and a given degree.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.