The kth Laplacian eigenvalue of a tree
β Scribed by Ji-Ming Guo
- Publisher
- John Wiley and Sons
- Year
- 2006
- Tongue
- English
- Weight
- 102 KB
- Volume
- 54
- Category
- Article
- ISSN
- 0364-9024
No coin nor oath required. For personal study only.
β¦ Synopsis
Abstract
Let Ξ»~k~(G) be the __k__th Laplacian eigenvalue of a graph G. It is shown that a tree T with n vertices has $\lambda_{k}(T)\le \lceil { {n}\over{k}}\rceil$ and that equality holds if and only if k < n, k|n and T is spanned by k vertex disjoint copies of ${K}_{{1}, { {n}\over {k}}-1}$, the star on ${{n}\over{k}}$ vertices. Β© 2006 Wiley Periodicals, Inc. J Graph Theory
π SIMILAR VOLUMES
## Abstract We prove a natural generalization to the __p__ βLaplacian of the celebrated Rellich identity. (Β© 2005 WILEYβVCH Verlag GmbH & Co. KGaA, Weinheim)
## Abstract It is shown that there exist domains Ξ© β β^__N__^, which outside of some ball coincide with the strip β^__N__ β 1^ Γ (0, Ο) and for which the Dirichlet Laplacian β Ξ has eigenvalues within the subinterval (1, 4) of the essential spectrum (1, β).