TY - JOUR
T1 - Properties of Total Transformation Graphs for General Sum-Connectivity Index
AU - Rani, Anam
AU - Imran, Muhammad
AU - Razzaque, Asima
AU - Ali, Usman
N1 - Publisher Copyright:
© 2021 Anam Rani et al.
PY - 2021
Y1 - 2021
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=85118557663&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85118557663&partnerID=8YFLogxK
U2 - 10.1155/2021/6616056
DO - 10.1155/2021/6616056
M3 - Article
AN - SCOPUS:85118557663
SN - 1076-2787
VL - 2021
JO - Complexity
JF - Complexity
M1 - 6616056
ER -