Investigation of General Power Sum-Connectivity Index for Some Classes of Extremal Graphs

Rui Cheng, Gohar Ali, Gul Rahmat, Muhammad Yasin Khan, Andrea Semanicova-Fenovcikova, Jia-Bao Liu and Muhammad Javaid

Complexity, 2021, vol. 2021, 1-8

Abstract: In this work, we introduce a new topological index called a general power sum-connectivity index and we discuss this graph invariant for some classes of extremal graphs. This index is defined by YαG=∑uv∈EGdudu+dvdvα, where du and dv represent the degree of vertices u and v, respectively, and α≥1. A connected graph G is called a k-generalized quasi-tree if there exists a subset Vk⊂VG of cardinality k such that the graph G−Vk is a tree but for any subset Vk−1⊂VG of cardinality k−1, the graph G−Vk−1 is not a tree. In this work, we find a sharp lower and some sharp upper bounds for this new sum-connectivity index.

Date: 2021
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/complexity/2021/6623277.pdf (application/pdf)
http://downloads.hindawi.com/journals/complexity/2021/6623277.xml (application/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:complx:6623277

DOI: 10.1155/2021/6623277

Access Statistics for this article

More articles in Complexity from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().