A spectral excess theorem for nonregular graphs
From MaRDI portal
Publication:439054
DOI10.1016/J.JCTA.2012.04.002zbMATH Open1245.05087OpenAlexW2127171818MaRDI QIDQ439054FDOQ439054
Chih-Wen Weng, Guang-Siang Lee
Publication date: 1 August 2012
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jcta.2012.04.002
Cites Work
- Title not available (Why is that?)
- The subconstituent algebra of an association scheme. I
- The spectral excess theorem for distance-regular graphs: a global (over)view
- Locally pseudo-distance-regular graphs
- From local adjacency polynomials to locally pseudo-distance-regular graphs
- On almost distance-regular graphs
- On the Polynomial of a Graph
- On distance-regularity in graphs
- Algebraic characterizations of distance-regular graphs
- On the algebraic theory of pseudo-distance-regularity around a set
- An odd characterization of the generalized odd graphs
- A simple proof of the spectral excess theorem for distance-regular graphs
- Eigenvalue interlacing and weight parameters of graphs
- Dual concepts of almost distance-regularity and the spectral excess theorem
- Spectral characterization of some generalized odd graphs
- Spectral characterization of odd graphs \(O_ k, k\leq 6\)
- On a class of polynomials and its relation with the spectra and diameters of graphs
Cited In (14)
- Edge-distance-regular graphs are distance-regular
- Spectrally extremal vertices, strong cospectrality, and state transfer
- A characterization and an application of weight-regular partitions of graphs
- Some spectral inequalities for triangle-free regular graphs
- The Laplacian spectral excess theorem for distance-regular graphs
- Some spectral and quasi-spectral characterizations of distance-regular graphs
- A unified framework for the expander mixing lemma for irregular graphs and its applications
- A spectral condition for the existence of a pentagon in non-bipartite graphs
- A generalization of the odd-girth theorem
- Equivalent characterizations of the spectra of graphs and applications to measures of distance-regularity
- A characterization of bipartite distance-regular graphs
- A spectral excess theorem for digraphs with normal Laplacian matrices
- On some approaches to the spectral excess theorem for nonregular graphs
- A spectral excess theorem for normal digraphs
This page was built for publication: A spectral excess theorem for nonregular graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q439054)