A spectral excess theorem for nonregular graphs

DOI10.1016/J.JCTA.2012.04.002MaRDI QIDQ439054zbMATH OpenOpenAlexFDO

Authors Guang-Siang Lee, Chih-Wen Weng

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

zbMATH Keywords

eigenvaluesdistance-regular graphsspectral excess theorem

Mathematics Subject Classification ID

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

Recommendations

• On some approaches to the spectral excess theorem for nonregular graphs
• The Laplacian spectral excess theorem for distance-regular graphs
• The spectral excess theorem for distance-biregular graphs.
• The spectral excess theorem for distance-regular graphs: a global (over)view
• A simple proof of the spectral excess theorem for distance-regular graphs

Cites work

• 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
• An odd characterization of the generalized odd graphs
• Dual concepts of almost distance-regularity and the spectral excess theorem
• Eigenvalue interlacing and weight parameters of graphs
• From local adjacency polynomials to locally pseudo-distance-regular graphs
• Locally pseudo-distance-regular graphs
• On a class of polynomials and its relation with the spectra and diameters of graphs
• On almost distance-regular graphs
• On distance-regularity in graphs
• On the Polynomial of a Graph
• On the algebraic theory of pseudo-distance-regularity around a set
• Spectral characterization of odd graphs \(O_ k, k\leq 6\)
• Spectral characterization of some generalized odd graphs
• The spectral excess theorem for distance-regular graphs: a global (over)view
• The subconstituent algebra of an association scheme. I

Cited in

(19)

• Edge-distance-regular graphs are distance-regular
• Spectrally extremal vertices, strong cospectrality, and state transfer
• A simple proof of the spectral excess theorem for distance-regular graphs
• The spectral excess theorem for distance-regular graphs: a global (over)view
• An excess theorem for spherical 2-designs
• Some spectral and quasi-spectral characterizations of distance-regular graphs
• A characterization and an application of weight-regular partitions of graphs
• The Laplacian spectral excess theorem for distance-regular graphs
• Some spectral inequalities for triangle-free 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
• On some approaches to the spectral excess theorem for nonregular graphs
• The spectral excess theorem for distance-biregular graphs.
• A short proof of the odd-girth theorem
• A spectral excess theorem for digraphs with normal Laplacian matrices
• 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)