Some results on Laplacian spectral radius of graphs with cut vertices
From MaRDI portal
Publication:607007
DOI10.1016/j.disc.2010.08.011zbMath1230.05203MaRDI QIDQ607007
Publication date: 19 November 2010
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2010.08.011
05C38: Paths and cycles
05C50: Graphs and linear algebra (matrices, eigenvalues, etc.)
05C12: Distance in graphs
Cites Work
- Unnamed Item
- Unnamed Item
- The effect on the Laplacian spectral radius of a graph by adding or grafting edges
- On the Laplacian spectral radius of trees with fixed diameter
- Minimizing the Laplacian eigenvalues for trees with given domination number
- The Laplacian spectral radius of a graph under perturbation
- Maximizing the Laplacian spectral radii of graphs with given diameter
- Laplacian matrices of graphs: A survey
- Problems in algebraic combinatorics
- On the Laplacian spectral radius of a tree.
- The Laplacian spectral radius of some bipartite graphs
- The Laplacian Spectrum of a Graph
- Matrix Analysis
- Rank one perturbation and its application to the laplacian spectrum of a graph∗
- The Laplacian Spectrum of a Graph II
- On Spectral Integral Variations of Graphs