Properties of Total Transformation Graphs for General Sum-Connectivity Index

被引:1
|
作者
Rani, Anam [1 ]
Imran, Muhammad [2 ]
Razzaque, Asima [1 ]
Ali, Usman [3 ,4 ]
机构
[1] King Faisal Univ Al Ahsa, Dept Basic Sci, Deanship Preparatory Year, Al Hufuf, Saudi Arabia
[2] United Arab Emirates Univ, Dept Math Sci, POB 15551, Al Ain, U Arab Emirates
[3] France Univ Paris, Inst Math Jussieu Paris Rive Gauche Paris, Sorbonne Univ, Paris, France
[4] Bahauddin Zakariya Univ, CASPAM, Multan 66000, Pakistan
关键词
UNICYCLIC GRAPHS; RESPECT; TRENDS;
D O I
10.1155/2021/6616056
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
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)= n-ary sumation (qq)& PRIME;& ISIN;(E(Q) )dq+dq & PRIME;?, 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.</p>
引用
收藏
页数:6
相关论文
empty
未找到相关数据