Journal of East China Normal University(Natural Sc

Previous Articles     Next Articles

On the signless Laplacian spectral radius of some graphs

CHEN Yuan-yuan[1], MU Shan-zhi[2], WANG Guo-ping[1]   

  1. 1. School of Mathematical Sciences, Xinjiang Normal University, Urumqi, 830054, China;
    2. Department of Mathematics, Jiangsu University of Technology, Changzhou Jiangsu 213001, China
  • Received:2015-12-29 Online:2017-01-25 Published:2017-01-13

Abstract:

Let A(G) be the adjacent matrix of G and Q(G) = D(G)+A(G) is the signless Laplacian matrix of G. The signless Laplacian spectral radius of G is the largest eigenvalue of Q(G). In this paper we characterize the graphs with the maximum signless Laplacian spectral radii among the graphs with given vertex connectivity, among the graphs with given number of blocks and among the graphs with given pendant vertices, respectively.

Key words: signless Laplacian spectral radius, vertex connectivity, block, pendant vertex