An edge-grafting theorem on Laplacian spectra of graphs and its application

DOI10.1080/03081080903441499zbMath1226.05175MaRDI QIDQ3082872

Rui-fang Liu, Ming-qing Zhai, Jin-Long Shu

Publication date: 17 March 2011

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

Full work available at URL: https://doi.org/10.1080/03081080903441499

zbMATH Keywords

diameter; unicyclic graph; Laplacian spectral radius; edge-grafting

Mathematics Subject Classification ID

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

Related Items

On the Laplacian spread of graphs

Cites Work

• The effect on the Laplacian spectral radius of a graph by adding or grafting edges
• Some results on the ordering of the Laplacian spectral radii of unicyclic graphs
• The Laplacian spectral radius of a graph under perturbation
• A note on Laplacian graph eigenvalues
• On the Laplacian eigenvalues of a graph
• Laplacian matrices of graphs: A survey
• A sharp upper bound on the largest eigenvalue of the Laplacian matrix of a graph
• The spectral radius of trees on \(k\) pendant vertices
• Sharp upper bounds for the Laplacian graph eigenvalues
• Sharp upper and lower bounds for largest eigenvalue of the Laplacian matrices of trees
• The Laplacian Spectrum of a Graph
• On the Spectral Radius of Complementary Acyclic Matrices of Zeros and Ones
• Eigenvalues of the Laplacian of a graph^∗