Abstract
Let G be a simple and undirected graph with Laplacian polynomial . In earlier works, some formulas for computing , and in terms of the number of vertices, the Wiener, the first Zagreb and the forgotten indices are given. In this paper, we continue this work by computing , where T is a tree. A lower and an upper bound for are obtained.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: 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.
