English

Signed graphs with fixed smallest eigenvalue at least $-3$ and their lattices

Combinatorics 2026-07-03 v1 Number Theory

Abstract

In this paper, we consider connected signed graphs with smallest eigenvalue at least 3ε-3-\varepsilon for a small positive constant ε\varepsilon. We prove that if such a signed graph has sufficiently large minimum valency, then its smallest eigenvalue is at least 3-3, and the lattice associated with it, which is generated by squared norm 33 vectors, is a sublattice of a direct sum of the standard lattice Zn\mathbb{Z}^n and copies of the root lattice E8E_8. Moreover, there exist infinitely many connected signed graphs with smallest eigenvalue at least 3-3 containing it as a proper induced subgraph. Furthermore, we discuss signed graphs with smallest eigenvalue 3-3 arising from rootless irreducible unimodular lattices.

Cite

@article{arxiv.2607.02951,
  title  = {Signed graphs with fixed smallest eigenvalue at least $-3$ and their lattices},
  author = {Meng-Yue Cao and Jack H. Koole and Jing-Yuan Liu and Qianqian Yang},
  journal= {arXiv preprint arXiv:2607.02951},
  year   = {2026}
}