The paper gives an explicit if-and-only-if classification of all connected graphs G for which the eigenvalue multiplicity of L(G) attains 2c(G)+p(G)-1.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.SP 1years
2024 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Line graphs with the largest eigenvalue multiplicity
The paper gives an explicit if-and-only-if classification of all connected graphs G for which the eigenvalue multiplicity of L(G) attains 2c(G)+p(G)-1.