Proves the distance-Laplacian analog of Brouwer's conjecture for diameter-bounded graphs with n large, all but two diameter-2 graphs, and graphs with Δ = n-k for n ≥ N(k).
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
-
On a distance Laplacian analog of Brouwer's conjecture for several classes of graphs
Proves the distance-Laplacian analog of Brouwer's conjecture for diameter-bounded graphs with n large, all but two diameter-2 graphs, and graphs with Δ = n-k for n ≥ N(k).