Spectral characterization of some generalized odd graphs
From MaRDI portal
The authors show that a graph having the spectrum of a generalized odd graph must be distance-regular with the corresponding parameters. In addition, generalized odd graphs which are characterized by their spectra are determined.
Recommendations
Cited in
(19)- Spectral characterization of odd graphs \(O_ k, k\leq 6\)
- Which graphs are determined by their spectrum?
- Spectral characterizations of some distance-regular graphs
- Cospectral mates for the union of some classes in the Johnson association scheme
- Spectral characterization of some cubic graphs
- Note on the spectral characterization of some cubic graphs with maximum number of triangles
- The spectrum of some generalized graphs related to cycle
- INVESTIGATION OF CONTINUOUS-TIME QUANTUM WALKS VIA SPECTRAL ANALYSIS AND LAPLACE TRANSFORM
- Spectral characterization of a graph on the flags of the eleven point biplane
- A spectral excess theorem for nonregular graphs
- A spectral excess theorem for normal digraphs
- Some spectral and quasi-spectral characterizations of distance-regular graphs
- On the spectral characterization of the union of complete multipartite graph and some isolated vertices
- Cospectral mates for generalized Johnson and Grassmann graphs
- An odd characterization of the generalized odd graphs
- Characterization of \(k\)-spectrally monomorphic two-graphs
- Spectral characterizations of the corona of a cycle and two isolated vertices
- Characterizing distance-regularity of graphs by the spectrum
- A generalization of the odd-girth theorem
This page was built for publication: Spectral characterization of some generalized odd graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1299998)
