Abstract
In this article, we consider the following problem: Of all trees on n vertices with diameter d (both fixed) which tree achieves the maximal Laplacian spectral radius? We show that the maximal Laplacian spectral radius is obtained uniquely at , where is a tree obtained by taking a path P on d + 1 vertices and adding n-d-1 pendant vertices to a center point of P.
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.