An odd characterization of the generalized odd graphs
From MaRDI portal
(Redirected from Publication:651037)
Abstract: We show that any connected regular graph with distinct eigenvalues and odd-girth is distance-regular, and in particular that it is a generalized odd graph.
Cites work
- 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}\)
- scientific article; zbMATH DE number 3717357 (Why is no real title available?)
- scientific article; zbMATH DE number 43547 (Why is no real title available?)
- 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
(10)- Odd length: odd diagrams and descent classes
- Edge-distance-regular graphs are distance-regular
- A spectral excess theorem for nonregular graphs
- A spectral excess theorem for normal digraphs
- Equivalent characterizations of the spectra of graphs and applications to measures of distance-regularity
- Some spectral and quasi-spectral characterizations of distance-regular graphs
- Edge-distance-regular graphs
- On the sum of the largest and smallest eigenvalue of odd-cycle free fraphs
- A characterization of the odd graphs and the doubled odd graphs with a few of their intersection numbers
- A generalization of the odd-girth theorem
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)