- 55 -

www.ivypub.org/mc
Mathematical Computation
June 2014, Volume 3, Issue 2, PP.55-57
On the Signless Laplacian Spectral Radius of
Some Graphs
J ingming Zhang
1, 2, #
, Tingzhu Huang
1

1. School of Mathematical Sciences, University of Electronic Science and Technology of China, Chengdu, Sichuan, 611731,
PR.China
2. College of Science, China University of Petroleum, Shandong, QingDao, 266580, PR. China
#Email: zhangjm7519@126.com
Abstract
The signless Laplacian spectral radius of a graph G is the largest eigenvalue of its signless Laplacian matrix. In this paper, we
determine the largest signless Laplacian spectral among some graphs.
Keywords: Spectral Radius; Signless Laplcian Spectral Radius; Unicyclic Graph
1 INTRODUCTION
Let ( ( ), ( )) G V G E G = be a simple connected graph with vertex set
1 2
{ , , , }
n
V v v v = and edge set E . Its adjacency
matrix ( ) ( )
ij
A G a = is defined as a n n matrix ( )
ij
a , where 1
ij
a = it
i
v is adjacent to
j
v ; and 0
ij
a = , otherwise.
Denote by ( )
i
d v or ( )
G i
d v the degree of the vertex ( 1, 2, , )
i
v i n = . Let ( ) ( ) ( ) Q G D G A G = + be the signless
Laplacian matrix of a graphG , where
1 2
( ) ( ( ), ( ), , ( ))
n
D G diag d v d v d v = denotes the diagonal matrix of the vertex
degrees of G . It is well known that ( ) A G is a real symmetric matrix and ( ) Q G is a positive semi-definite matrix.
Hence, the eigenvalues of can be ordered as
1 2
( ) ( ) ( ) 0
n
q G q G q G > > > > . The largest eigenvalues of ( ) A G
( ( ) Q G , respectively) is called the spectral radius (signless Laplacian spectral radius, respectively) of G , denoted by
( ) G ( ( ) q G , respectively). When G is connected, ( ) A G and ( ) Q G are nonnegative irreducible matrix. By the
Perron-Frobenius Theorem, ( ) q G is simple and has a unique positive unit eigenvector. We refer to such the
eigenvector corresponding to ( ) q G as the Perron vector of G .Two distinct edges in a graph G are independent if
they are not adjacent inG . The characteristic polynomial of ( ) A G is ( ( )) det xI A G , which is denoted by ( ) G u or
( , ) G x u .The characteristic polynomial of ( ) Q G is ( ( )) det xI Q G , which is denoted by ( ) G + or ( , ) G x + . A
unicyclic graph is a connected graph in which the number of vertices equals the number of edges. The investigation
on the spectral radius (signless Laplacian spectral radius, respectively ) of graphs is an important topic in the theory
of graph spectra, and some early results can go back to the very beginnings (see [1]). In this paper, we determine the
largest signless Laplacian spectral radius among some graphs.
2 LEMMAS
Lemma 2.1 ([2, 3]) Let G be a connected graph, and , u v be two vertices of G . Suppose that
1 2
, , , ( ) \ { ( ) }
s
v v v N v N u u e (1 ( )) s d v s s and
1 2
( , , , )
n
x x x x = is the Perron vector of G , where
i
x
corresponds to the vertex
i
v (1 ) i n s s . Let
*
G be the graph obtained from G by deleting the edges
i
vv and adding
the edges (1 )
i
uv i s s s . If
u v
x x > , then
*
( ) ( ) q G q G < .
Lemma 2.2 ([4, 5]) Let G be a graph on n vertices and m edges. Then
2
( ( )) ( , )
m n
S G x G x

u = + , where ( ) G u and
( ) G + are the characteristic polynomials of ( ) A G and ( ) Q G , respectively.
Lemma 2.3 ([6]) Let e uv = be an edge of G , and ( ) C e be the set of all circuits containing e . Then ( ) G u satisfies
( ) ( ) ( ) 2 ( ( )),
Z
G G e G u v G V Z u = u u u

where the summation extends over all ( ) Z C e e .

- 56 -
www.ivypub.org/mc
From [7], we immediately have
Corollary 2.4. Let ( ) G A be the maximum degree of G . Then ( ) ( ) G G > A .

FIG.1
3 CONCLUSIONS
Theorem 3.1 Let
1
G ,
2
G and
3
G be the graphs as Fig.1. Then for 6 n > ,
1 2
( ) ( ) q G q G > ,
1 3
( ) ( ) q G q G > .
Proof. From Lemma 2.1, it is easy to see that
1 2
( ) ( ) q G q G > . Now we prove that
1 3
( ) ( ) q G q G > . From Lemma 2.3,
we have
2 2 2 4 2 4 10
3 1
8 6
4 2
( ( )) ( ( )) ( 1) ( 3 1) [( 3)
(20 6 6 ) (11 49 10 )
(54 3 6 ) ( 25) 4]
n
S G S G x x x x n x
n x n x
n x n x

u u = +
+ + +
+ + + +

If 10 n > , it is easy to prove that for 1 x n > + ,
2
1 0 x > ,
4 2
3 1 0 x x + > and
10 8 6 4 2
( 3) (20 6 6 ) (11 49 10 ) (54 6 3 ) ( 25) 4 0 n x n x n x n x n x + + + + + + + > . By Corollary 2.4, we
know that
1
( ( )) 1 S G n > + . Thus,
1 3
( ( )) ( ( )) ( 10) S G S G n > > . For 6 9 n s s , by direct calculation, we have
1 3
( ( )) ( ( )) S G S G > . By Lemma 2.2, we have
1 3
( ) ( ) q G q G > .
ACKNOWLEDGMENT
This research is supported by NSFC (61170311), Chinese Universities Specialized Research Fund for the Doctoral
Program (20110185110020), Sichuan Province Sci. \& Tech. Research Project (12ZC1802) and the Fundamental
Research Funds for the Central Universities.
REFERENCES
[1] L. Collatz, U. Sinogowitz, Spektren endlicher grapen, Abh. Math. Sem. Univ. Hamburg 21(1957) 63-77.
[2] D. Cvetkovi_c, P. Rowlinson, S. K. Simi_c, Signless Laplacian of _nite graphs, Linear Algebra Appl. 423(2007) 155-171.
[3] Y. Hong, X. D. Zhang, Sharp upper and lower bounds for largest eigenvalue of the Laplacian matrices of trees, Discrete
Mathematics, 296(2005) 187-197.
[4] D. Cvetkovi_c, M. Doob, H. Sachs, Spectra of graphs, third ed., Johann Ambrosius Barth Verlag, Heidelberg, Leipzig, 1995.
[5] B. Zhou, I. Gutman, A connection between ordinary and Laplacian spectra of bipartite graphs, Linear and Multilinear Algebra.
56(2008) 305-310.
[6] A. J. Schwenk, R. J. Wilson, On the eigenvalues of a graph, in: L. W. Beineke, R. J. Wilson(Eds.), Selected Topics in Graph
Theory, Academic Press, London, 1978, 307-336 (Chapter II).
[7] Q. Li, K. Q. Feng, On the largest eigenvalue of graphs (Chinese), Acta Math. Appl. Sinica 2(1979) 167-175.



- 57 -
www.ivypub.org/mc
AUTHORS
1
Jing-Ming Zhang was born in ShanDong province in
1975. PhD in School of Mathematical Sciences, University of Electronic Science and Technology of China,
Chengdu. The authors major field is numerical algebra and scientific computation He once worked as a teacher
in China University of Petroleum in ShanDong province. So far, he has published two papers in LAA and.
nowadays; he is being interested in preconditioning techniques for large sparse linear systems.