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

Abstract

In this paper, we consider connected signed graphs with smallest eigenvalue at least -3- 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 -3, and the lattice associated with it, which is generated by squared norm 3 vectors, is a sublattice of a direct sum of the standard lattice Zn and copies of the root lattice E8. Moreover, there exist infinitely many connected signed graphs with smallest eigenvalue at least -3 containing it as a proper induced subgraph. Furthermore, we discuss signed graphs with smallest eigenvalue -3 arising from rootless irreducible unimodular lattices.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…