An odd characterization of the generalized odd graphs
Abstract
We show that any connected regular graph with d+1 distinct eigenvalues and odd-girth 2d+1 is distance-regular, and in particular that it is a generalized odd graph.
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.