We study the properties of the eigenvector corresponding to the Laplacian spectral radius of a graph and show some applications. We obtain some results on the Laplacian spectral radius of a graph by grafting and adding edges. We also determine the structure of the maximal Laplacian spectrum tree among trees with n vertices and k pendant vertices (n, k fixed), and the upper bound of the Laplacian spectral radius of some trees.
机构:
S China Normal Univ, Dept Math, Guangzhou 510631, Guangdong, Peoples R ChinaS China Normal Univ, Dept Math, Guangzhou 510631, Guangdong, Peoples R China
机构:
South China Normal Univ, Sch Math Sci, Guangzhou 510631, Guangdong, Peoples R ChinaSouth China Normal Univ, Sch Math Sci, Guangzhou 510631, Guangdong, Peoples R China
Chen, Mingzhu
Zhou, Bo
论文数: 0引用数: 0
h-index: 0
机构:
South China Normal Univ, Sch Math Sci, Guangzhou 510631, Guangdong, Peoples R ChinaSouth China Normal Univ, Sch Math Sci, Guangzhou 510631, Guangdong, Peoples R China
机构:
S China Normal Univ, Sch Math Sci, Guangzhou 510631, Guangdong, Peoples R ChinaS China Normal Univ, Sch Math Sci, Guangzhou 510631, Guangdong, Peoples R China
Lin, Hongying
Zhou, Bo
论文数: 0引用数: 0
h-index: 0
机构:
S China Normal Univ, Sch Math Sci, Guangzhou 510631, Guangdong, Peoples R ChinaS China Normal Univ, Sch Math Sci, Guangzhou 510631, Guangdong, Peoples R China
机构:
Tohoku Univ, Grad Sch Informat Sci, Aoba Ku, Sendai, Miyagi 9808577, JapanTohoku Univ, Grad Sch Informat Sci, Aoba Ku, Sendai, Miyagi 9808577, Japan