Proves that for a χ-chromatic graph the first ℓ1−1 distance Laplacian eigenvalues satisfy ∂^L_i(G) ≥ n + ℓ1 where ℓ1 is the largest color-class size, refining distribution and extremal results.
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
-
Extremal chromatic bounds for distance Laplacian eigenvalues
Proves that for a χ-chromatic graph the first ℓ1−1 distance Laplacian eigenvalues satisfy ∂^L_i(G) ≥ n + ℓ1 where ℓ1 is the largest color-class size, refining distribution and extremal results.