Some spectral and quasi-spectral characterizations of distance-regular graphs
Rights accessOpen Access
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.
© <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/
CitationAbiad, 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.