Some spectral and quasi-spectral characterizations of distance-regular graphs
Visualitza/Obre
Cita com:
hdl:2117/100654
Tipus de documentArticle
Data publicació2016-10-01
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
In this paper we consider the concept of preintersection numbers of a graph. These numbers are determined by the spectrum of the adjacency matrix of the graph, and generalize the intersection numbers of a distance-regular graph. By using the preintersection numbers we give some new spectral and quasi-spectral characterizations of distance-regularity, in particular for graphs with large girth or large odd-girth. (C) 2016 Published by Elsevier Inc.
Descripció
© <2016>. This manuscript version is made available under the CC-BY-NC-ND 4.0 license http://creativecommons.org/licenses/by-nc-nd/4.0/
CitacióAbiad, A., Van Dam, E., Fiol, M. Some spectral and quasi-spectral characterizations of distance-regular graphs. "Journal of combinatorial theory. Series A", 1 Octubre 2016, vol. 143, p. 1-18.
ISSN0097-3165
Versió de l'editorhttp://www.sciencedirect.com/science/article/pii/S0097316516300061
Fitxers | Descripció | Mida | Format | Visualitza |
---|---|---|---|---|
Revision(2l)JCTA-D-00131.pdf | 467,5Kb | Visualitza/Obre |