Loading...
Loading...

Go to the content (press return)

Some spectral and quasi-spectral characterizations of distance-regular graphs

Author
Abiad, A.; Van Dam, E.; Fiol, M.
Type of activity
Journal article
Journal
Journal of combinatorial theory. Series A
Date of publication
2016-10-01
Volume
143
First page
1
Last page
18
DOI
https://doi.org/10.1016/j.jcta.2016.04.004 Open in new window
Project funding
Optimización y problemas extremales en teoria de grafos y combinatoria. Aplicacions a les redes de comunicación
Repository
http://hdl.handle.net/2117/100654 Open in new window
URL
http://www.sciencedirect.com/science/article/pii/S0097316516300061 Open in new window
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. © <2016>. This manuscript version is made availa...
Citation
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.
Keywords
Distance-regular graph, Eigenvalues, Girth, Odd-girth, Preintersection numbers
Group of research
COMBGRAPH - Combinatorics, Graph Theory and Applications

Participants

Attachments