A structure theory for signed graphs with fixed smallest eigenvalue
Combinatorics
2026-02-25 v1
Abstract
In this paper, we will give a structure theory for signed graphs with fixed smallest eigenvalue and investigate signed graphs with smallest eigenvalue greater than . Given a real number , we show that the following hold for each signed graph with smallest eigenvalue at least and large minimum valency: there exist dense induced subgraphs in such that each vertex lies in at most 's and almost all edges of lie in at least one of the 's; if , then has smallest eigenvalue at least and is -integrable.
Cite
@article{arxiv.2602.20783,
title = {A structure theory for signed graphs with fixed smallest eigenvalue},
author = {Jack H. Koolen and Jing-Yuan Liu and Qianqian Yang and Meng-Yue Cao},
journal= {arXiv preprint arXiv:2602.20783},
year = {2026}
}