A short proof of the odd-girth theorem (Q456332)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6098354
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A short proof of the odd-girth theorem |
scientific article; zbMATH DE number 6098354 |
Statements
A short proof of the odd-girth theorem (English)
0 references
24 October 2012
0 references
Summary: Recently, it has been shown that a connected graph \(\Gamma\) with \(d+1\) distinct eigenvalues and odd-girth \(2d+1\) is distance-regular. The proof of this result was based on the spectral excess theorem. In this note we present an alternative and more direct proof which does not rely on the spectral excess theorem, but on a known characterization of distance regular graphs in terms of the predistance polynomial of degree \(d\).
0 references
eigenvalues of graphs
0 references
distance-regular graphs
0 references
0.8296542167663574
0 references
0.7979243993759155
0 references
0.7919554710388184
0 references
0.781761646270752
0 references
0.7747829556465149
0 references
