A note on graphs with exactly two main eigenvalues
Combinatorics
2016-09-01 v1
Abstract
In this note, we consider connected graphs with exactly two main eigenvalues. We will give several constructions for them, and as a consequence we show a family of those graphs with an unbounded number of distinct valencies.
Keywords
Cite
@article{arxiv.1608.08702,
title = {A note on graphs with exactly two main eigenvalues},
author = {Sakander Hayat and Jack H. Koolen and Fenjin Liu and Zhi Qiao},
journal= {arXiv preprint arXiv:1608.08702},
year = {2016}
}
Comments
9 pages, 1 figure, 1 table