Chinese Quarterly Journal of Mathematics ›› 2010, Vol. 25 ›› Issue (4): 615-625.

Previous Articles     Next Articles

On the Laplacian Spectral Radius of Trees

  

  1. Department of Applied Mathematics, China University of Petroleum
  • Received:2006-10-26 Online:2010-12-30 Published:2023-05-22
  • About author: TAN Shang-wang(1965-), male, native of Taian, Shandong, a professor of China University of Petroleum, M.S.D., engages in graph theory
  • Supported by:
    Supported by National Natural Science Foundation of China(10871204);

Abstract: Some sharp upper bounds of Laplacian spectral radius of trees in terms of order, diameter, pendant vertex number, covering number, edge covering number or total independence number are given. And the ninth to thirteenth largest values of Laplacian spectral radius over the class of trees on a given order are also given.

Key words: Laplacian spectral radius, tree, diameter

CLC Number: