The effect on the Laplacian spectral radius of a graph by adding or grafting edges
From MaRDI portal
Publication:817636
DOI10.1016/j.laa.2005.08.002zbMath1082.05059OpenAlexW2040228829MaRDI QIDQ817636
Publication date: 16 March 2006
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2005.08.002
Related Items (40)
Monster graphs are determined by their Laplacian spectra ⋮ An edge-rotating theorem on the least eigenvalue of graphs ⋮ Effect on normalized graph Laplacian spectrum by motif attachment and duplication ⋮ The largest Laplacian and adjacency indices of complete caterpillars of fixed diameter ⋮ Edge perturbation on graphs with clusters: adjacency, Laplacian and signless Laplacian eigenvalues ⋮ Unnamed Item ⋮ On the Laplacian spectral radius of trees with fixed diameter ⋮ Minimizing Laplacian spectral radius of unicyclic graphs with fixed girth ⋮ Laplacian spectral radius and maximum degree of trees with perfect matchings ⋮ Some graphs determined by their (signless) Laplacian spectra ⋮ Some results on Laplacian spectral radius of graphs with cut vertices ⋮ On the second largest Laplacian eigenvalues of graphs ⋮ The Laplacian spectral radii of unicyclic and bicyclic graphs with \(n\) vertices and \(k\) pendant vertices ⋮ The smallest Laplacian spectral radius of graphs with a given clique number ⋮ On the Laplacian spectra of graphs with pockets ⋮ A conjecture on the diameter and signless Laplacian index of graphs ⋮ On ordinary and signless Laplacian spectral radius of graphs with fixed number of branch vertices ⋮ Distributed consensus of multi-agent systems with increased convergence rate ⋮ Laplacian spectral radius of trees with given maximum degree ⋮ Some results on the ordering of the Laplacian spectral radii of unicyclic graphs ⋮ Second-order consensus in multi-agent systems based on second-order neighbours’ information ⋮ Laplacian spectral determination of path-friendship graphs ⋮ The Laplacian spectral radius of some bipartite graphs ⋮ On the Laplacian spectral radii of trees with nearly perfect matchings ⋮ On the Estrada and Laplacian Estrada indices of graphs ⋮ On the Laplacian spectral radii of bipartite graphs ⋮ The Laplacian spectral radius for unicyclic graphs with given independence number ⋮ On the Laplacian spectral radii of bicyclic graphs ⋮ Interlacing eigenvalues on some operations of graphs ⋮ The minimal Laplacian spectral radius of trees with a given diameter ⋮ The (signless) Laplacian spectral radius of unicyclic and bicyclic graphs with n vertices and k pendant vertices ⋮ The Laplacian spectral radius of a graph under perturbation ⋮ Graphs with clusters perturbed by regular graphs -- \(A_\alpha \)-spectrum and applications ⋮ On the second smallest and the largest normalized Laplacian eigenvalues of a graph ⋮ An edge-grafting theorem on Laplacian spectra of graphs and its application ⋮ The Laplacian spectral radius of some graphs ⋮ The Laplacian spectral radius of tricyclic graphs with \(n\) vertices and \(k\) pendant vertices ⋮ On the Laplacian spectral radii of trees with perfect matchings ⋮ On the Laplacian spectral radii of trees ⋮ The effect on Aα-eigenvalues of mixed graphs and unit gain graphs by adding edges in clusters
Cites Work
This page was built for publication: The effect on the Laplacian spectral radius of a graph by adding or grafting edges