The spectral excess theorem for graphs with few eigenvalues whose distance-2 or distance-1-or-2 graph is strongly regular
Visualitza/Obre
10.1080/03081087.2018.1491944
Inclou dades d'ús des de 2022
Cita com:
hdl:2117/119639
Tipus de documentArticle
Data publicació2018-07
EditorTaylor & Francis
Condicions d'accésAccés obert
Llevat que s'hi indiqui el contrari, els
continguts d'aquesta obra estan subjectes a la llicència de Creative Commons
:
Reconeixement-NoComercial-SenseObraDerivada 3.0 Espanya
Abstract
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-regular.
Descripció
This is an Accepted Manuscript of
an article published by Taylor & Francis Group in Linear and multilinear algebra on july 2018, available online at: http://www.tandfonline.com/10.1080/03081087.2018.1491944.
CitacióDalfo, C., Fiol, M., Koolen, J. The spectral excess theorem for graphs with few eigenvalues whose distance-2 or distance-1-or-2 graph is strongly regular. "Linear and multilinear algebra", Juliol 2018, vol. 67, núm. 12, p. 2373-2381.
ISSN0308-1087
Versió de l'editorhttps://www.tandfonline.com/doi/abs/10.1080/03081087.2018.1491944
Fitxers | Descripció | Mida | Format | Visualitza |
---|---|---|---|---|
2018-06-07-2nd- ... -29-LMA-rev-2017-03-08.pdf | Article principal | 314,9Kb | Visualitza/Obre |