An odd characterization of the generalized odd graphs

DOI10.1016/j.jctb.2011.03.001zbMath1234.05157arXiv1202.2300OpenAlexW3104185615MaRDI QIDQ651037

Willem H. Haemers, van Dam, Edwin R.

Publication date: 8 December 2011

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1202.2300

zbMATH Keywords

distance-regular graphsspectral characterizationspectra of graphsspectral excess theoremodd-girthgeneralized odd graphs

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Distance in graphs (05C12)

Related Items

Edge-distance-regular graphs are distance-regular ⋮ A generalization of the odd-girth theorem ⋮ A spectral excess theorem for nonregular graphs ⋮ A spectral excess theorem for normal digraphs ⋮ Some spectral and quasi-spectral characterizations of distance-regular graphs ⋮ Edge-distance-regular graphs ⋮ Equivalent characterizations of the spectra of graphs and applications to measures of distance-regularity

Cites Work

• Unnamed Item
• Unnamed Item
• Characterizing distance-regularity of graphs by the spectrum
• A simple proof of the spectral excess theorem for distance-regular graphs
• The spectral excess theorem for distance-regular graphs: a global (over)view
• Developments on spectral characterizations of graphs
• Spectral characterization of some generalized odd graphs
• Algebraic characterizations of distance-regular graphs
• From local adjacency polynomials to locally pseudo-distance-regular graphs
• Graphs with constant \(\mu\) and \(\overline{\mu}\)
• Which graphs are determined by their spectrum?