An Odd Characterization of the Generalized Odd Graphs
CentER Discussion Paper Series No. 2010-47
5 Pages Posted: 28 Apr 2010
Date Written: April 27, 2010
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.
Keywords: distance-regular graphs, generalized odd graphs, odd-girth, spectra of graphs, spectral excess theorem, spectral characterization
JEL Classification: C0
Suggested Citation: Suggested Citation
Do you have negative results from your research you’d like to share?
Recommended Papers
-
On 3-Chromatic Distance-Regular Graphs
By Aart Blokhuis, Andries E. Brouwer, ...
-
Combinatorial Designs with Two Singular Values Ii. Partial Geometric Designs
By Edwin Van Dam and E. Spence
-
Combinatorial Designs with Two Singular Values I. Uniform Multiplicative Designs
By Edwin Van Dam and E. Spence
-
Spectral Characterization of the Hamming Graphs
By Sejeong Bang, Edwin Van Dam, ...
-
Some Implications on Amorphic Association Schemes
By Edwin Van Dam and Mikhail Muzychuk
-
Strongly Regular Graphs with Parameters (4m^4, 2m^4 + m^2, m^4 + m^2, m^4 + m2) Exist for All m>1
By Willem H. Haemers and Qing Xiang
-
By Edwin Van Dam, William Martin, ...