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

preprint2014arXivOpen access

Abstract

Let the Kneser graph KK 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 KK. In particular, we obtain strong results in the so-called `half antipodal' case.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.