On a version of the spectral excess theorem

DOI10.5614/EJGTA.2020.8.2.15zbMATH Open1468.05149arXiv1906.01307OpenAlexW3095732714MaRDI QIDQ4958005FDOQ4958005

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)

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.

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

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

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)

Cites Work

• Spectra of graphs
• 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
• Title not available (Why is that?)
• On the Polynomial of a Graph
• On distance-regularity in graphs
• Algebraic characterizations of distance-regular graphs
• The Laplacian spectral excess theorem for distance-regular graphs
• A simple proof of the spectral excess theorem for distance-regular graphs
• Some families of orthogonal polynomials of a discrete variable and their applications to graphs and codes
• Quotient-polynomial graphs

Cited In (8)

• 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
• Title not available (Why is that?)
• On symmetric association schemes and associated quotient-polynomial graphs
• A spectral exclusion principle for unbounded subnormals

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)