English

Distance-regular graphs where the distance-$d$ graph has fewer distinct eigenvalues

Combinatorics 2014-09-02 v1

Abstract

Let the Kneser graph KK of a distance-regular graph Γ\Gamma be the graph on the same vertex set as Γ\Gamma, where two vertices are adjacent when they have maximal distance in Γ\Gamma. We study the situation where the Bose-Mesner algebra of Γ\Gamma is not generated by the adjacency matrix of KK. In particular, we obtain strong results in the so-called `half antipodal' case.

Keywords

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}
}
R2 v1 2026-06-22T05:45:27.680Z