On spectral radius of graphs with pendant paths

Abstract

The spectral radius of a graph is the largest eigenvalue of the adjacency matrix corresponding to this graph. Let G be a graph with long pendant paths. In this note, we estimate the spectral radius of G, by obtaining appropriate upper and lower bounds. As an application, the spectral radius of some k-ary trees are estimated.