Abstract
The general sum-connectivity index of a graph G is defined as χα(G)=∑uv∈E(G)(d(u)+d(v))α, where d(u) denotes the degree of a vertex u in G and α is a real number. In this paper, we present the maximum general sum-connectivity indices of trees and chemical trees with given number of pendent vertices for −1≤α<0. The corresponding extremal graphs are also characterized.
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.
