Derives upper and lower bounds on the extremal eigenvalues of the A_alpha matrix in terms of graph invariants such as order, size, and degrees.
The maximum clique and the signless laplacian eigenvalues
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2025 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Bounds on $A_\alpha$-eigenvalues using graph invariants
Derives upper and lower bounds on the extremal eigenvalues of the A_alpha matrix in terms of graph invariants such as order, size, and degrees.