paper

Signed graphs with fixed smallest eigenvalue at least and their lattices

arXiv:2607.02951

Abstract

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

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