Carregant...
Carregant...

Vés al contingut (premeu Retorn)

The spectral excess theorem for graphs with few eigenvalues whose distance-2 or distance-1-or-2 graph is strongly regular

Autor
Dalfo, C.; Fiol, M.; Koolen, J.
Tipus d'activitat
Article en revista
Revista
Linear and multilinear algebra
Data de publicació
2018-07
DOI
https://doi.org/10.1080/03081087.2018.1491944 Obrir en finestra nova
Repositori
http://hdl.handle.net/2117/119639 Obrir en finestra nova
URL
https://www.tandfonline.com/doi/abs/10.1080/03081087.2018.1491944 Obrir en finestra nova
Resum
We study regular graphs whose distance-2 graph or distance-1-or-2 graph is strongly regular. We provide a characterization of such graphs G (among regular graphs with few distinct eigenvalues) in terms of the spectrum and the mean number of vertices at maximal distance d from every vertex, where d+ 1 is the number of different eigenvalues of G. This can be seen as another version of the so-called spectral excess theorem, which characterizes in a similar way those regular graphs that are distance...
Paraules clau
Distance-regular graph, distance-2 graph, predistance polynomials., spectrum
Grup de recerca
COMBGRAPH - Combinatòria, Teoria de Grafs i Aplicacions

Participants