
On the distribution of Laplacian eigenvalues of trees
2013; Elsevier BV; Volume: 313; Issue: 21 Linguagem: Inglês
10.1016/j.disc.2013.06.017
ISSN1872-681X
AutoresRodrigo O. Braga, Virgı́nia M. Rodrigues, Vilmar Trevisan,
Tópico(s)Limits and Structures in Graph Theory
ResumoFor a tree T with n vertices, we apply an algorithm due to Jacobs and Trevisan (2011) to study how the number of small Laplacian eigenvalues behaves when the tree is transformed by a transformation defined by Mohar (2007). This allows us to obtain a new bound for the number of eigenvalues that are smaller than 2. We also report our progress towards a conjecture on the number of eigenvalues that are smaller than the average degree.
Referência(s)