Properties of Total Transformation Graphs for General Sum-Connectivity Index

Anam Rani, Muhammad Imran, Asima Razzaque, Usman Ali and Dan SeliÅŸteanu

Complexity, 2021, vol. 2021, 1-6

Abstract: The study of networks and graphs through structural properties is a massive area of research with developing significance. One of the methods used in studying structural properties is obtaining quantitative measures that encode structural data of the whole network by the real number. A large collection of numerical descriptors and associated graphs have been used to examine the whole structure of networks. In these analyses, degree-related topological indices have a significant position in theoretical chemistry and nanotechnology. Thus, the computation of degree-related indices is one of the successful topics of research. The general sum-connectivity GSC index of graph Q is described as Ï‡Ï Q=∑qq′∈EQdq+dqâ€²Ï , where dq presents the degree of the vertex q in Q and Ï is a real number. The total graph TQ is a graph whose vertex set is VQ∪EQ, and two vertices are linked in TQ if and only if they are either adjacent or incident in Q. In this article, we study the general sum-connectivity index Ï‡Ï Q of total graphs for different values of Ï by using Jensen’s inequality.

Date: 2021
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/complexity/2021/6616056.pdf (application/pdf)
http://downloads.hindawi.com/journals/complexity/2021/6616056.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:6616056

DOI: 10.1155/2021/6616056

Access Statistics for this article

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