Abstract
The Sombor index of a graph is defined as where denote the degree of the vertex in . In this article, we determine the extremal values of the Sombor index of trees with some given parameters, including matching number, pendant vertices, diameter, segment number, branching number, etc. The corresponding extremal trees are characterized completely.
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 callMore From: match Communications in Mathematical and in Computer Chemistry
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.
