Distance-regular graphs with valency k having smallest eigenvalue at most -k/2
Combinatorics
2015-07-23 v2
Abstract
In this paper, we study the non-bipartite distance-regular graphs with valency k and having a smallest eigenvalue at most -k/2.
Cite
@article{arxiv.1507.04839,
title = {Distance-regular graphs with valency k having smallest eigenvalue at most -k/2},
author = {Jack Koolen and Zhi Qiao},
journal= {arXiv preprint arXiv:1507.04839},
year = {2015}
}