An odd characterization of the generalized odd graphs

DOI10.1016/J.JCTB.2011.03.001MaRDI QIDQ651037zbMATH OpenOpenAlexFDO

Authors Willem H. Haemers, Edwin R. Van Dam

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)

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.

Cites work

• scientific article; zbMATH DE number 3717357 (Why is no real title available?)
• scientific article; zbMATH DE number 43547 (Why is no real title available?)
• A simple proof of the spectral excess theorem for distance-regular graphs
• Algebraic characterizations of distance-regular graphs
• Characterizing distance-regularity of graphs by the spectrum
• Developments on spectral characterizations of graphs
• From local adjacency polynomials to locally pseudo-distance-regular graphs
• Graphs with constant \(\mu\) and \(\overline{\mu}\)
• Spectral characterization of some generalized odd graphs
• The spectral excess theorem for distance-regular graphs: a global (over)view
• Which graphs are determined by their spectrum?

Cited in

(9)

• Edge-distance-regular graphs are distance-regular
• A spectral excess theorem for nonregular graphs
• A characterization of the odd graphs and the doubled odd graphs with a few of their intersection numbers
• Some spectral and quasi-spectral characterizations of distance-regular graphs
• Odd length: odd diagrams and descent classes
• A generalization of the odd-girth theorem
• Equivalent characterizations of the spectra of graphs and applications to measures of distance-regularity
• A spectral excess theorem for normal digraphs
• Edge-distance-regular graphs

This page was built for publication: An odd characterization of the generalized odd graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q651037)