Distance-regular graphs where the distance-$d$ graph has fewer distinct eigenvalues
Combinatorics
2014-09-02 v1
Abstract
Let the Kneser graph of a distance-regular graph be the graph on the same vertex set as , where two vertices are adjacent when they have maximal distance in . We study the situation where the Bose-Mesner algebra of is not generated by the adjacency matrix of . In particular, we obtain strong results in the so-called `half antipodal' case.
Cite
@article{arxiv.1409.0389,
title = {Distance-regular graphs where the distance-$d$ graph has fewer distinct eigenvalues},
author = {A. E. Brouwer and M. A. Fiol},
journal= {arXiv preprint arXiv:1409.0389},
year = {2014}
}