Safet Penjic
Andrej Maru\v{s}i\v{c} Institute, University of Primorska, Muzejski trg 2 6000 Koper, Slovenia

Published : 1 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 1 Documents
Search

On a version of the spectral excess theorem Miquel Àngel Fiol; Safet Penjic
Electronic Journal of Graph Theory and Applications (EJGTA) Vol 8, No 2 (2020): Electronic Journal of Graph Theory and Applications
Publisher : GTA Research Group, Univ. Newcastle, Indonesian Combinatorics Society and ITB

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.5614/ejgta.2020.8.2.15

Abstract

Given a regular (connected) graph G=(X,E) with adjacency matrix A, d+1 distinct eigenvalues, and diameter D, we give a characterization  of when its distance matrix AD is a polynomial in A, in terms of the adjacency spectrum of G and the arithmetic (or harmonic) mean of the numbers of vertices at distance at most D-1 from every vertex. The same result 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.