Maximizing the signless Laplacian spectral radius of graphs with given diameter or cut vertices
From MaRDI portal
Publication:3090721
DOI10.1080/03081087.2010.499363zbMath1222.05182OpenAlexW2097229212MaRDI QIDQ3090721
Jianfeng Wang, Qiong Xiang Huang
Publication date: 1 September 2011
Published in: Linear and Multilinear Algebra (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/03081087.2010.499363
Related Items (6)
Maximizing the \(A_\alpha \)-spectral radius of graphs with given size and diameter ⋮ Maximizing the signless Laplacian spectral radius of \(k\)-connected graphs with given diameter ⋮ Maximizing the spectral radius of \(k\)-connected graphs with given diameter ⋮ The signless \(p\)-Laplacian spectral radius of graphs with given degree sequences ⋮ On the signless Laplacian index of unicyclic graphs with fixed diameter ⋮ On the \(A_\alpha\)-spectral radius of a graph
Cites Work
- Spectral radii of graphs with given chromatic number
- Signless Laplacians of finite graphs
- Laplacian spectral radius of trees with given maximum degree
- Towards a spectral theory of graphs based on the signless Laplacian. II.
- Graphs with given diameter maximizing the spectral radius
- Maximizing the Laplacian spectral radii of graphs with given diameter
- On graphs whose signless Laplacian index does not exceed 4.5
- On the spectral radius of (0,1)-matrices
- On the maximal index of graphs with a prescribed number of edges
- On the maximal index of connected graphs
- On the spectral radius of graphs with cut vertices
- On the spectral radius of graphs with cut edges
- The Laplacian spectral radius of some bipartite graphs
- On bags and bugs
- Sharp upper and lower bounds for largest eigenvalue of the Laplacian matrices of trees
- Eigenvalue bounds for the signless laplacian
- On the mean square of the Riemann zeta-function in short intervals
- On the Spectral Radius of Complementary Acyclic Matrices of Zeros and Ones
This page was built for publication: Maximizing the signless Laplacian spectral radius of graphs with given diameter or cut vertices