Open AccessLower bound for the spectral radius of the starlike trees
Author(s) -
Rubí Arrizaga-Zercovich
Publication year - 2021
Publication title -
journal of physics. conference series
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.21
H-Index - 85
eISSN - 1742-6596
pISSN - 1742-6588
DOI - 10.1088/1742-6596/2090/1/012127
Subject(s) - spectral radius , adjacency matrix , combinatorics , upper and lower bounds , eigenvalues and eigenvectors , tree (set theory) , mathematics , radius , graph , adjacency list , degree (music) , physics , computer science , mathematical analysis , quantum mechanics , computer security , acoustics
A tree is a connected acyclic graph. A tree is called a starlike if exactly one of its vertices has degree greater than two. Let λι be the largest eigenvalue of the adjacency matrix of a starlike tree. In this work, we obtain a lower bound for the spectral radius of a starlike tree. This bound only depends of the maximum degree of the vertices.