Journal of University of Science and Technology of China ›› 2014, Vol. 44 ›› Issue (12): 982-985.DOI: 10.3969/j.issn.0253-2778.2014.12.003

• Original Paper • Previous Articles    

Minimum distance signless Laplacian spectral radius of connected graphs with cut vertices

LI Xiaoxin, ZHA Shuping   

  1. 1.Department of Mathematics, Chizhou College, Chizhou 247000, China; 2.School of Mathematics and Computation Sciences, Anqing Normal College, Anqing 246133, China
  • Received:2014-03-22 Revised:2014-11-08 Accepted:2014-11-08 Online:2014-11-08 Published:2014-11-08

Abstract: In the class of connected graphs on n vertices with cut vertices, the unique graph with minimum distance signless Laplacian spectral radius was determined by using eigenvector equation to study eigenvalues and a lower bound for the distance signless Laplacian spectral radius in terms of order n was given.

Key words: graph, distance signless Laplacian matrix, spectral radius, cut vertex

CLC Number: