Some Spectral and Quasi-Spectral Characterizations of Distance-Regular Graphs
Combinatorics
2016-04-20 v4
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.
Keywords
Cite
@article{arxiv.1404.3973,
title = {Some Spectral and Quasi-Spectral Characterizations of Distance-Regular Graphs},
author = {A. Abiad and E. R. van Dam and M. A. Fiol},
journal= {arXiv preprint arXiv:1404.3973},
year = {2016}
}