The Laplacian spectral radius of a graph under perturbation
From MaRDI portal
Publication:1005808
DOI10.1016/j.camwa.2007.02.009zbMath1155.05330OpenAlexW2064873811MaRDI QIDQ1005808
Publication date: 10 March 2009
Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.camwa.2007.02.009
Related Items (19)
Maxima of the Laplacian spectral radius of (minimally) 2-connected graphs with fixed size ⋮ Minimizing Laplacian spectral radius of unicyclic graphs with fixed girth ⋮ On the second largest distance eigenvalue of a block graph ⋮ Some results on Laplacian spectral radius of graphs with cut vertices ⋮ On the (signless) Laplacian spectral characterization of the line graphs of lollipop graphs ⋮ Effects on the normalized Laplacian spectral radius of non-bipartite graphs under perturbation and their applications ⋮ The effect on the (signless Laplacian) spectral radii of uniform hypergraphs by subdividing an edge ⋮ The Laplacian spectral radii of unicyclic and bicyclic graphs with \(n\) vertices and \(k\) pendant vertices ⋮ On graphs whose Laplacian index does not exceed 4.5 ⋮ The smallest Laplacian spectral radius of graphs with a given clique number ⋮ Graphs whose signless Laplacian spectral radius does not exceed the Hoffman limit value ⋮ The (signless) Laplacian spectral radii ofc-cyclic graphs withnvertices, girthgandkpendant vertices ⋮ On limit points of Laplacian spectral radii of graphs ⋮ Some results on the ordering of the Laplacian spectral radii of unicyclic graphs ⋮ The Laplacian spectral radius for unicyclic graphs with given independence number ⋮ Interlacing eigenvalues on some operations of graphs ⋮ An edge-grafting theorem on Laplacian spectra of graphs and its application ⋮ The Laplacian spectral radius of tricyclic graphs with \(n\) vertices and \(k\) pendant vertices ⋮ The Laplacian spread of line graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Combinatorial properties and the complexity of a max-cut approximation
- The performance of an eigenvalue bound on the max-cut problem in some classes of graphs
- The effect on the Laplacian spectral radius of a graph by adding or grafting edges
- Eigenvalues, diameter, and mean distance in graphs
- Laplacian graph eigenvectors
- Laplacian eigenvalues and the maximum cut problem
- Laplacian matrices of graphs: A survey
- On the Laplacian spectral radius of a tree.
- Expanding and forwarding
- On the second largest Laplacian eigenvalue of trees
- Sharp upper and lower bounds for largest eigenvalue of the Laplacian matrices of trees
- The Laplacian Spectrum of a Graph
- Matrix Analysis
- On the Shannon capacity of a graph
- The Laplacian Spectrum of a Graph II
- An Upper Bound on the Diameter of a Graph from Eigenvalues Associated with Its Laplacian
This page was built for publication: The Laplacian spectral radius of a graph under perturbation