Distance-regular graphs with valency k having smallest eigenvalue at most -k/2

Published 17 Jul 2015 in math.CO | (1507.04839v2)

Abstract: In this paper, we study the non-bipartite distance-regular graphs with valency k and having a smallest eigenvalue at most -k/2.

No one has generated a summary of this paper yet.

No one has generated a video about this paper yet.

No one has generated a whiteboard explanation for this paper yet.

We haven't generated a list of open problems mentioned in this paper yet.

We haven't generated follow-up questions for this paper yet.