Maximizing the Laplacian spectral radii of graphs with given diameter

DOI10.1016/j.laa.2008.10.008zbMath1184.05081OpenAlexW2048098594MaRDI QIDQ1014456

Zhonghua Lu, Ming-qing Zhai, Jin-Long Shu

Publication date: 29 April 2009

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.laa.2008.10.008

zbMATH Keywords

bipartite graphdiameterLaplacian spectral radius

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items (7)

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 ⋮ Some results on Laplacian spectral radius of graphs with cut vertices ⋮ On the Laplacian spread of graphs ⋮ The Laplacian spectral radius of bicyclic graphs with a given girth ⋮ Maxima of \(L\)-index and \(Q\)-index: graphs with given size and diameter ⋮ Maximizing the signless Laplacian spectral radius of graphs with given diameter or cut vertices

Cites Work

• Unnamed Item
• Minimizing the Laplacian eigenvalues for trees with given domination number
• Graphs with given diameter maximizing the spectral radius
• On the spectral radius of bipartite graphs with given diameter
• A note on Laplacian graph eigenvalues
• Laplacian matrices of graphs: A survey
• A sharp upper bound on the largest eigenvalue of the Laplacian matrix of a graph
• The Laplacian spectral radius of some bipartite graphs
• Sharp upper and lower bounds for largest eigenvalue of the Laplacian matrices of trees
• The Laplacian Spectrum of a Graph
• Eigenvalues of the Laplacian of a graph^∗

This page was built for publication: Maximizing the Laplacian spectral radii of graphs with given diameter