On ordering bicyclic graphs with respect to the Laplacian spectral radius

DOI10.1016/j.aml.2011.06.023zbMath1234.05154MaRDI QIDQ654277

Shuchao Li, Qin Zhao, Dejan V. Tošić, Slobodan K. Simic

Publication date: 28 December 2011

Published in: Applied Mathematics Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.aml.2011.06.023

zbMATH Keywords

bicyclic graph; Laplacian spectral radius; spectral ordering

Mathematics Subject Classification ID

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

Related Items

Unnamed Item, Absolute algebraic connectivity of double brooms and trees, On the Laplacian spectral radius of bipartite graphs with fixed order and size, Ordering trees and graphs with few cycles by algebraic connectivity, New applications of the variational iteration method -- from differential equations to \(q\)-fractional difference equations, Variational iteration method for fractional calculus -- a universal approach by Laplace transform, On extremal bipartite bicyclic graphs

Cites Work

• Old and new results on algebraic connectivity of graphs
• Ordering trees with \(n\) vertices and matching number \(q\) by their largest Laplacian eigenvalues
• Some results on the ordering of the Laplacian spectral radii of unicyclic graphs
• On the Laplacian spectral radii of bicyclic graphs
• A note on Laplacian graph eigenvalues
• Laplacian matrices of graphs: A survey
• An improved upper bound for Laplacian graph eigenvalues
• On the Laplacian spectral radius of a tree.
• Ordering trees by their Laplacian spectral radii
• Sharp upper and lower bounds for largest eigenvalue of the Laplacian matrices of trees
• Eigenvalues of the Laplacian of a graph^∗
• Maximizing Algebraic Connectivity Over Unicyclic Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item