Distance-regular graphs with valency k having smallest eigenvalue at most -k/2 (1507.04839v2)

Published 17 Jul 2015 in math.CO

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

We haven't generated a summary for this paper yet.

Generate a whiteboard explanation of this paper.

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.