Abstract

One of the newest molecular descriptors, the general sum-connectivity index of a graph G is defined as ?a(G) = Suv?E(G)(d(u)+d(v))a, where d(u) denotes the degree of vertex u in G and a is a real number. The aim of this paper is to determine the trees and the unicyclic graphs with k pendant vertices that maximize the general sum-connectivity index for a= 1, with 2= k

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 call

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.