An application of Hoffman graphs for spectral characterizations of graphs
Combinatorics
2016-09-01 v1
Abstract
In this paper, we present the first application of Hoffman graphs for spectral characterizations of graphs. In particular, we show that the -clique extension of the -grid is determined by its spectrum when is large enough. This result will help to show that the Grassmann graph is determined by its intersection numbers as a distance regular graph, if is large enough.
Keywords
Cite
@article{arxiv.1608.08800,
title = {An application of Hoffman graphs for spectral characterizations of graphs},
author = {Qianqian Yang and Aida Abiad and Jack H. Koolen},
journal= {arXiv preprint arXiv:1608.08800},
year = {2016}
}