The unique extremal graph maximizing edges or spectral radius among n-vertex graphs with b(G) < 1/r is characterized for each integer r ≥ 1, along with the bipartite case.
Haemers, Interlacing eigenvalues and graphs,Linear Algebra Appl.226-228 (1995) 593-616
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
-
Extremal results for graphs with binding number strictly less than $1/r$
The unique extremal graph maximizing edges or spectral radius among n-vertex graphs with b(G) < 1/r is characterized for each integer r ≥ 1, along with the bipartite case.