For large n, the maximum signless Laplacian spectral radius among n-vertex r-dimensional pure simplicial complexes without r-dimensional wheels is attained by specific extremal complexes, generalizing graph results and providing a spectral analogue of the Sós-Erdős-Brown theorem for r=2.
Zhang, The Laplacian eigenvalues of graphs: a survey, arXiv: 1111.2897
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
-
Signless Laplacian spectral radius of simplicial complexes without $r$-dimensional wheels
For large n, the maximum signless Laplacian spectral radius among n-vertex r-dimensional pure simplicial complexes without r-dimensional wheels is attained by specific extremal complexes, generalizing graph results and providing a spectral analogue of the Sós-Erdős-Brown theorem for r=2.