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.
|Journal||Journal of Combinatorial Theory, Series B, Graph theory|
|Publication status||Published - 2011|
- distance-regular graphs
- generalized odd graphs
- spectra of graphs
- spectral excess theorem
- spectral characterization