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.
Original language | English |
---|---|
Pages (from-to) | 486-489 |
Journal | Journal of Combinatorial Theory Series B |
Volume | 101 |
Issue number | 6 |
DOIs | |
Publication status | Published - 2011 |
Keywords
- distance-regular graphs
- generalized odd graphs
- odd-girth
- spectra of graphs
- spectral excess theorem
- spectral characterization