An odd characterization of the generalized odd graphs
classification
🧮 math.CO
keywords
generalizedgraphcharacterizationconnecteddistance-regulardistincteigenvaluesgraphs
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.