Abstract
We study trees of given order, given number of pendant vertices, segments and branching vertices. We present upper and lower bounds on the general multiplicative Zagreb indices for trees of given order and number of pendant vertices/segments/branching vertices. Bounds on the first and the second multiplicative Zagreb indices are corollaries of the general results. We also characterize trees having the largest and the smallest indices.
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.
