Abstract
Let [Formula: see text] be a simple connected graph. The inverse sum indeg index of [Formula: see text], denoted by [Formula: see text], is defined as the sum of the weights [Formula: see text] of all edges [Formula: see text] of [Formula: see text], where [Formula: see text] denotes the degree of a vertex in [Formula: see text]. In this paper, we derive some bounds for the inverse sum indeg index in terms of some graph parameters, such as vertex (edge) connectivity, chromatic number, vertex bipartiteness, etc. The corresponding extremal graphs are characterized, respectively.
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.
