On a version of the spectral excess theorem

DOI10.5614/EJGTA.2020.8.2.15MaRDI QIDQ4958005zbMATH OpenOpenAlexFDO

Authors Safet Penjić, Miquel Angel Fiol

Publication date 6 September 2021

Published in Electronic Journal of Graph Theory and Applications (Search for Journal in Brave)

Copyright license Creative Commons Attribution-ShareAlike 4.0 International

Full work available at URL https://arxiv.org/abs/1906.01307

zbMATH Keywords

graphdistance-regular graphharmonic meanLaplacianspectrumadjacency algebra

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Association schemes, strongly regular graphs (05E30)

Abstract: Given a regular (connected) graph $Gamma=(X,E)$ with adjacency matrix $A$, $d+1$ distinct eigenvalues, and diameter $D$, we give a characterization of when its distance matrix $A_D$ is a polynomial in $A$, in terms of the adjacency spectrum of $Gamma$ and the arithmetic (or harmonic) mean of the numbers of vertices at distance $leD-1$ of every vertex. The same results is proved for any graph by using its Laplacian matrix $L$ and corresponding spectrum. When $D=d$ we reobtain the spectral excess theorem characterizing distance-regular graphs.

Recommendations

• The Laplacian spectral excess theorem for distance-regular graphs
• A simple proof of the spectral excess theorem for distance-regular graphs
• The spectral excess theorem for distance-regular graphs: a global (over)view
• On some approaches to the spectral excess theorem for nonregular graphs
• Equivalent characterizations of the spectra of graphs and applications to measures of distance-regularity

Cites work

• scientific article; zbMATH DE number 3445271 (Why is no real title available?)
• A simple proof of the spectral excess theorem for distance-regular graphs
• Algebraic characterizations of distance-regular graphs
• From local adjacency polynomials to locally pseudo-distance-regular graphs
• Locally pseudo-distance-regular graphs
• On distance-regularity in graphs
• On the Polynomial of a Graph
• Quotient-polynomial graphs
• Some families of orthogonal polynomials of a discrete variable and their applications to graphs and codes
• Spectra of graphs
• The Laplacian spectral excess theorem for distance-regular graphs
• The spectral excess theorem for distance-regular graphs: a global (over)view

Cited in

(17)

• The spectral excess theorem for distance-regular graphs having distance-\(d\) graph with fewer distinct eigenvalues
• The spectral excess theorem for distance-regular graphs having distance-\(d\) graph with fewer distinct eigenvalues
• A simple proof of the spectral excess theorem for distance-regular graphs
• A spectral Szegő theorem on the real line
• Dual concepts of almost distance-regularity and the spectral excess theorem
• The spectral excess theorem for distance-regular graphs: a global (over)view
• A lower bound for the discriminant of polynomials related to Chebyshev polynomials
• An excess theorem for spherical 2-designs
• A generalization of the odd-girth theorem
• scientific article; zbMATH DE number 4004896 (Why is no real title available?)
• Equivalent characterizations of the spectra of graphs and applications to measures of distance-regularity
• On symmetric association schemes and associated quotient-polynomial graphs
• A spectral exclusion principle for unbounded subnormals
• The spectral excess theorem for graphs with few eigenvalues whose distance-2 or distance-1-or-2 graph is strongly regular
• 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: On a version of the spectral excess theorem

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