Upper bound for the Laplacian eigenvalues of a graph

Details Upper bound for the Laplacian eigenvalues of a graph Upper bound for the Laplacian eigenvalues of a graph

2011-06-03

arxiv.org/abs/1106.0769v1

Mathematics

Combinatorics

3 pages

Scientific paper

In this note we give a new upper bound for the Laplacian eigenvalues of an unweighted graph. Let $G$ be a simple graph on $n$ vertices. Let $d_{m}(G)$ and $\lambda_{m+1}(G)$ be the $m$-th smallest degree of $G$ and the $m+1$-th smallest Laplacian eigenvalue of $G$ respectively. Then $ \lambda_{m+1}(G)\leq d_{m}(G)+m-1 $ for $\bar{G} \neq K_{m}+(n-m)K_1 $. We also introduce upper and lower bound for the Laplacian eigenvalues of weighted graphs, and compare it with the special case of unweighted graphs.

Affiliated with

Also associated with

No associations

Rating

Upper bound for the Laplacian eigenvalues of a graph does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Upper bound for the Laplacian eigenvalues of a graph, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Upper bound for the Laplacian eigenvalues of a graph will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-6958