A generalized Bethe tree is a rooted tree in which vertices at the same distance from the root have the same degree. Let P-m be a path of m vertices. Let {B-i : 1 <= i <= m} be a set of generalized Bethe trees. Let P-m {B-i : 1 <= i <= m} be the tree obtained from P-m and the trees B-1, B-2, ..., B-m by identifying the root vertex of B-i with the ith vertex of P-m. We give a complete characterization of the eigenvalues of the Laplacian and adjacency matrices of P-m{B-i : 1 <= i <= m}. In particular, we characterize their spectral radii and the algebraic conectivity. Moreover, we derive results concerning their multiplicities. Finally, we apply the results to the case B-1 = B-2 = ... = B-m. (C) 2008 Elsevier Inc. All rights reserved.
机构:
Nanjing Univ, Dept Math, Nanjing 210093, Peoples R China
Jiangsu Normal Univ, Sch Math & Stat, Xuzhou 221009, Jiangsu, Peoples R ChinaNanjing Univ, Dept Math, Nanjing 210093, Peoples R China
机构:
Shaanxi Univ technol, Sch Math & Comp Sci, Hanzhong, Peoples R China
Lanzhou Univ, Dept Math, Lanzhou, Gansu, Peoples R ChinaShaanxi Univ technol, Sch Math & Comp Sci, Hanzhong, Peoples R China
Ren, Shengzhang
Deng, Fang-an
论文数: 0引用数: 0
h-index: 0
机构:
Shaanxi Univ technol, Sch Math & Comp Sci, Hanzhong, Peoples R ChinaShaanxi Univ technol, Sch Math & Comp Sci, Hanzhong, Peoples R China
Deng, Fang-an
2017 4TH INTERNATIONAL CONFERENCE ON INFORMATION SCIENCE AND CONTROL ENGINEERING (ICISCE),
2017,
: 717
-
722