Abstract
Distance-regularity of a graph is in general not determined by the spectrum of the graph. The spectral excess theorem states that a connected regular graph is distance-regular if for every vertex, the number of vertices at extremal distance (the excess) equals some given expression in terms of the spectrum of the graph. This result was proved by Fiol and Garriga [From local adjacency polynomials to locally pseudo-distance-regular graphs, J. Combinatorial Th. B 71 (1997), 162-183] using a local approach. This approach has the advantage that more general results can be proven, but the disadvantage that it is quite technical. The aim of the current paper is to give a less technical proof by taking a global approach.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
