An edge-grafting theorem on Laplacian spectra of graphs and its application
From MaRDI portal
Publication:3082872
DOI10.1080/03081080903441499zbMath1226.05175OpenAlexW1968076253MaRDI 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
Related Items (1)
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∗
This page was built for publication: An edge-grafting theorem on Laplacian spectra of graphs and its application