Abstract
Denote by T ( n , q , w 1 , w 2 , … , w n - 1 ) the set of n-vertex weighted trees with matching number q and fixed positive weight set W n - 1 = { w 1 , w 2 , … , w n - 1 } , where w 1 ⩾ w 2 ⩾ ⋯ ⩾ w n - 1 > 0 . Tan [S.W. Tan, On the sharp upper bound of spectral radius of weighted trees, J. Math. Res. Exposition 29 (2009) 293–301] determined the weighted tree in T ( n , q , w 1 , w 2 , … , w n - 1 ) with the largest adjacent spectral radius , whereas in [S.W. Tan, On the Laplacian spectral radius of weighted trees with a positive weight set, Discrete Math. 310 (2010) 1026–1036] Tan determined the weighted tree in T ( n , q , w 1 , w 2 , … , w n - 1 ) with the largest Laplacian spectral radius. In this paper, we use a unified approach to identify the unique weighted tree in T ( n , q , w 1 , w 2 , … , w n - 1 ) with the largest adjacent spectral radius and largest Laplacian spectral radius, respectively.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.