Connected subcubic graphs without eigenvalues in (-1,1) consist of exactly two infinite families and seven sporadic graphs on at most 18 vertices.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Subcubic graphs without eigenvalues in $(-1, 1)$
Connected subcubic graphs without eigenvalues in (-1,1) consist of exactly two infinite families and seven sporadic graphs on at most 18 vertices.