On some approaches to the spectral excess theorem for nonregular graphs

DOI10.1016/J.JCTA.2013.03.010zbMATH Open1278.05089arXiv1205.5859OpenAlexW1982331428MaRDI QIDQ388198

Miquel Angel Fiol

Publication date: 19 December 2013

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Abstract: The Spectral Excess Theorem (SPET) for distance-regular graphs states that a regular (connected) graph is distance-regular if and only if its spectral-excess equals its average excess. Recently, some local or global approaches to the SPET have been used to obtain new versions of the theorem for nonregular graphs, and also to study the problem of characterizing the graphs which have the corresponding distance-regularity property. In this paper, some of these versions are related and compared, and some of their results are improved. As a result, a sufficient condition for a graph to be distance-polynomial is obtained.

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

zbMATH Keywords

distance-regular graphlocal spectrumorthogonal polynomialsdistance-polynomial graphspectral excess theorem

Mathematics Subject Classification ID

Distance in graphs (05C12) Orthogonal functions and polynomials, general theory of nontrigonometric harmonic analysis (42C05)

Cites Work

• Title not available (Why is that?)
• Spectra of graphs
• The spectral excess theorem for distance-regular graphs: a global (over)view
• Locally pseudo-distance-regular graphs
• Problems in algebraic combinatorics
• From local adjacency polynomials to locally pseudo-distance-regular graphs
• On almost distance-regular graphs
• A spectral excess theorem for nonregular graphs
• On the Polynomial of a Graph
• On distance-regularity in graphs
• On the algebraic theory of pseudo-distance-regularity around a set
• A simple proof of the spectral excess theorem for distance-regular graphs

Cited In (3)

• The Laplacian spectral excess theorem for distance-regular graphs
• A spectral excess theorem for digraphs with normal Laplacian matrices
• A spectral excess theorem for normal digraphs

Recommendations

• The spectral excess theorem for distance-regular graphs: a global (over)view 👍 👎
• A spectral excess theorem for nonregular graphs 👍 👎
• The Laplacian spectral excess theorem for distance-regular graphs 👍 👎
• The spectral excess theorem for distance-biregular graphs. 👍 👎
• A spectral excess theorem for normal digraphs 👍 👎
• The spectral excess theorem for graphs with few eigenvalues whose distance-2 or distance-1-or-2 graph is strongly regular 👍 👎
• Spectral results on graphs with regularity constraints 👍 👎
• A simple proof of the spectral excess theorem for distance-regular graphs 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎

This page was built for publication: On some approaches to the 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 Q388198)