Signed analogue of line graphs and their smallest eigenvalues
Combinatorics
2021-04-06 v2
Abstract
In this paper, we show that every connected signed graph with smallest eigenvalue strictly greater than and large enough minimum degree is switching equivalent to a complete graph. This is a signed analogue of a theorem of Hoffman. The proof is based on what we call Hoffman's limit theorem which we formulate for Hermitian matrices, and also the extension of the concept of Hoffman graph and line graph for the setting of signed graphs.
Keywords
Cite
@article{arxiv.2003.05578,
title = {Signed analogue of line graphs and their smallest eigenvalues},
author = {Alexander L. Gavrilyuk and Akihiro Munemasa and Yoshio Sano and Tetsuji Taniguchi},
journal= {arXiv preprint arXiv:2003.05578},
year = {2021}
}
Comments
20 pages, minor revision