On the Sanskruti index of graphs

被引:14
作者
Mondal, Sourav [1 ]
Das, Kinkar Chandra [2 ]
机构
[1] Natl Inst Technol Durgapur, Dept Math, Durgapur 713209, W Bengal, India
[2] Sungkyunkwan Univ, Dept Math, Suwon 16419, South Korea
基金
新加坡国家研究基金会;
关键词
Molecular graph; QSPR study; Topological index; Sanskruti index; COMPARING ZAGREB INDEXES; BOND CONNECTIVITY INDEX; HARMONIC INDEX; NUMBER; BOUNDS;
D O I
10.1007/s12190-022-01789-w
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
The topological indices are important tools in the chemical graph theory to model different physico-chemical properties of molecules. The Sanskruti index for a graph G having vertex set V (G) and edges set E(G) is defined as S(G) = Sigma(uv is an element of(G)) (delta(G)(u)delta(G)(v)/delta(G)(u) + delta(G)(v) - 2)(3), where delta(G)(u) represents the degree sum of nodes adjacent to u is an element of V (G). In this report, we argue that the chemical applicability of the S-index in the paper (Hosamani in J Appl Math Comput 54:425-433, 2017) is investigated incorrectly. In addition to correcting the result, we perform a comprehensive investigation to uncover the chemical significance of S. Some interesting mathematical features of the index are also explored by deriving some tight bounds with identifying the extremal graphs.
引用
收藏
页码:1205 / 1219
页数:15
相关论文
共 39 条
[1]   ON THE EXTREMAL GRAPHS FOR SECOND ZAGREB INDEX WITH FIXED NUMBER OF VERTICES AND CYCLOMATIC NUMBER [J].
Ali, Akbar ;
Das, Kinkar Ch. ;
Akhter, Sohail .
MISKOLC MATHEMATICAL NOTES, 2022, 23 (01) :41-50
[2]  
Bhadoria R.S., 2022, MULTIMED TOOLS APPL
[3]   Neighbors degree sum energy of graphs [J].
Boregowda, H. S. ;
Jummannaver, R. B. .
JOURNAL OF APPLIED MATHEMATICS AND COMPUTING, 2021, 67 (1-2) :579-603
[4]   A Lower Bound for the Harmonic Index of a Graph with Minimum Degree at Least Three [J].
Cheng, Minghong ;
Wang, Ligong .
FILOMAT, 2016, 30 (08) :2249-2260
[5]   Extremal values of vertex-degree-based topological indices over graphs [J].
Cruz R. ;
Pérez T. ;
Rada J. .
Journal of Applied Mathematics and Computing, 2015, 48 (1-2) :395-406
[6]  
Das KC, 2004, MATCH-COMMUN MATH CO, P103
[7]   Maximizing the sum of the squares of the degrees of a graph [J].
Das, KC .
DISCRETE MATHEMATICS, 2004, 285 (1-3) :57-66
[8]  
Das KC, 2012, MATCH-COMMUN MATH CO, V68, P189
[9]  
Das KC, 2010, MATCH-COMMUN MATH CO, V63, P433
[10]   New upper bounds on Zagreb indices [J].
Das, Kinkar Ch. ;
Gutman, Ivan ;
Zhou, Bo .
JOURNAL OF MATHEMATICAL CHEMISTRY, 2009, 46 (02) :514-521