Title of article :
The spectral radius of trees on k pendant vertices Original Research Article
Author/Authors :
Baofeng Wu، نويسنده , , Enli Xiao، نويسنده , , Yuan Hong، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 2005
Pages :
7
From page :
343
To page :
349
Abstract :
In this paper we consider the following problem: Of all trees of order n with k pendant vertices (n, k fixed), which achieves the maximal spectral radius? We show that the maximal spectral radius is obtained uniquely at Tn,k, where Tn,k is a tree obtained from a star K1,k and k paths of almost equal lengths by joining each pendant vertex of K1,k to an end vertex of one path. We also discuss the spectral radius of Tn,k and get some results.
Keywords :
graph , tree , Spectral radius , Pendant vertex
Journal title :
Linear Algebra and its Applications
Serial Year :
2005
Journal title :
Linear Algebra and its Applications
Record number :
824683
Link To Document :
بازگشت