Abstract
The general sum-connectivity index of a graph [Formula: see text], denoted by [Formula: see text], is defined as [Formula: see text], where [Formula: see text] is the edge connecting the vertices [Formula: see text], [Formula: see text] denotes the degree of the vertex [Formula: see text], and [Formula: see text] is a nonzero real number. This paper is devoted to characterizing the graphs having the maximal [Formula: see text] value among all the trees with order [Formula: see text] and fixed maximum degree.
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.
