Spectra of generalized Bethe trees attached to a path
โ Scribed by Oscar Rojo; Luis Medina
- Publisher
- Elsevier Science
- Year
- 2009
- Tongue
- English
- Weight
- 238 KB
- Volume
- 430
- Category
- Article
- ISSN
- 0024-3795
No coin nor oath required. For personal study only.
โฆ Synopsis
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
๐ SIMILAR VOLUMES
For fixed positive integer k, let E n denote the set of lattice paths using the steps 1 1 , 1 -1 , and k 0 and running from 0 0 to n 0 while remaining strictly above the x-axis elsewhere. We first prove bijectively that the total area of the regions bounded by the paths of E n and the x-axis satisfi
The 'All Minors Matrix Tree Theorem' (Chen, Applied Graph Theory, Graphs and Electrical Networks, North-Holland, Amsterdam, 1976; Chaiken, SIAM J. Algebraic Discrete Math. 3 (3) (1982) 319-329) is an extension of the well-known 'Matrix Tree Theorem' (Tutte, Proc. Cambridge Philos. Sot. 44 (1948) 463