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

Ji-Ming Guo

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 spectraAn edge-rotating theorem on the least eigenvalue of graphsEffect on normalized graph Laplacian spectrum by motif attachment and duplicationThe largest Laplacian and adjacency indices of complete caterpillars of fixed diameterEdge perturbation on graphs with clusters: adjacency, Laplacian and signless Laplacian eigenvaluesUnnamed ItemOn the Laplacian spectral radius of trees with fixed diameterMinimizing Laplacian spectral radius of unicyclic graphs with fixed girthLaplacian spectral radius and maximum degree of trees with perfect matchingsSome graphs determined by their (signless) Laplacian spectraSome results on Laplacian spectral radius of graphs with cut verticesOn the second largest Laplacian eigenvalues of graphsThe Laplacian spectral radii of unicyclic and bicyclic graphs with \(n\) vertices and \(k\) pendant verticesThe smallest Laplacian spectral radius of graphs with a given clique numberOn the Laplacian spectra of graphs with pocketsA conjecture on the diameter and signless Laplacian index of graphsOn ordinary and signless Laplacian spectral radius of graphs with fixed number of branch verticesDistributed consensus of multi-agent systems with increased convergence rateLaplacian spectral radius of trees with given maximum degreeSome results on the ordering of the Laplacian spectral radii of unicyclic graphsSecond-order consensus in multi-agent systems based on second-order neighbours’ informationLaplacian spectral determination of path-friendship graphsThe Laplacian spectral radius of some bipartite graphsOn the Laplacian spectral radii of trees with nearly perfect matchingsOn the Estrada and Laplacian Estrada indices of graphsOn the Laplacian spectral radii of bipartite graphsThe Laplacian spectral radius for unicyclic graphs with given independence numberOn the Laplacian spectral radii of bicyclic graphsInterlacing eigenvalues on some operations of graphsThe minimal Laplacian spectral radius of trees with a given diameterThe (signless) Laplacian spectral radius of unicyclic and bicyclic graphs with n vertices and k pendant verticesThe Laplacian spectral radius of a graph under perturbationGraphs with clusters perturbed by regular graphs -- \(A_\alpha \)-spectrum and applicationsOn the second smallest and the largest normalized Laplacian eigenvalues of a graphAn edge-grafting theorem on Laplacian spectra of graphs and its applicationThe Laplacian spectral radius of some graphsThe Laplacian spectral radius of tricyclic graphs with \(n\) vertices and \(k\) pendant verticesOn the Laplacian spectral radii of trees with perfect matchingsOn the Laplacian spectral radii of treesThe 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