The Laplacian spectral radius of a graph under perturbation

Authors:
Ji-Ming Guo
Affiliations:
Department of Applied Mathematics, China University of Petroleum, Shandong, Dongying 257061, PR China
Venue:
Computers & Mathematics with Applications
Year:
2007

Citing 9
Cited 1

Matrix analysis

Matrix analysis
The Laplacian spectrum of a graph

SIAM Journal on Matrix Analysis and Applications
The performance of an eigenvalue bound on the max-cut problem in some classes of graphs

Discrete Mathematics
Combinatorial properties and complexity of a max-cut approximation

European Journal of Combinatorics
The Laplacian Spectrum of a Graph II

SIAM Journal on Discrete Mathematics
An Upper Bound on the Diameter of a Graph from Eigenvalues Associated with its Laplacian

SIAM Journal on Discrete Mathematics
Laplacian eigenvalues and the maximum cut problem

Mathematical Programming: Series A and B
Expanding and forwarding

Discrete Applied Mathematics
On the Shannon capacity of a graph

IEEE Transactions on Information Theory

Some results on the ordering of the Laplacian spectral radii of unicyclic graphs

Discrete Applied Mathematics

Quantified Score

Hi-index	0.09

Visualization

Abstract

In this paper, we investigate how the Laplacian spectral radius changes when one graph is transferred to another graph obtained from the original graph by adding some edges, or subdivision, or removing some edges from one vertex to another.