Abstract Let G=(V,E) be a simple graph on vertex set V={v1,v2,…,vn}. Further let di be the degree of vi and Ni be the set of neighbors of vi. It is shown that max d i +d j −|N i ∩N j |:1⩽i v i v j ∈E is an upper bound for the largest eigenvalue of the Laplacian matrix of G, where |Ni∩Nj| denotes the number of common neighbors between vi and vj. For any G, this bound does not exceed the order of G. Further using the concept of common neighbors another upper bound for the largest eigenvalue of the Laplacian matrix of a graph has been obtained as max 2 d 2 i +d i m ′ i :1⩽i⩽n , where m ′ i = ∑ j d j −|N i ∩N j |:v i v j ∈E d i .
[1]
Bo Zhou,et al.
On Laplacian Eigenvalues of a Graph
,
2004
.
[2]
T. D. Morley,et al.
Eigenvalues of the Laplacian of a graph
,
1985
.
[3]
Xiao-Dong Zhang,et al.
On the Laplacian eigenvalues of a graph
,
1998
.
[4]
R. Merris.
A note on Laplacian graph eigenvalues
,
1998
.
[5]
Oscar Rojo,et al.
An always nontrivial upper bound for Laplacian graph eigenvalues
,
2000
.
[6]
Zhang Xiaodong,et al.
A new upper bound for eigenvalues of the laplacian matrix of a graph
,
1997
.