On neighborhood inverse sum indeg index of molecular graphs with chemical significance

被引:26
作者
Das, Kinkar Chandra [1 ]
Mondal, Sourav [2 ]
机构
[1] Sungkyunkwan Univ, Dept Math, Suwon 16419, South Korea
[2] Natl Inst Technol Durgapur, Dept Math, Durgapur 713209, West Bengal, India
基金
新加坡国家研究基金会;
关键词
Molecular descriptor; Neighborhood inverse sum indeg index; Inverse sum indeg index(ISI); Second Zagreb index(M2); Vertex Connectivity; ZAGREB INDEXES;
D O I
10.1016/j.ins.2022.12.016
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Chemical graph theory is an interdisciplinary field that analyses the molecular structure of a chemical compound as a graph and investigates related mathematical queries by employ-ing graph theoretical and computational techniques. The topological index is an important tool in this area that associates a numerical value with a graph structure. It can be inter-preted as a real-valued function that represents the physico-chemical information of a chemical compound. One of the most recently reported neighbourhood degree sum -based indices is the neighbourhood inverse sum indeg index (NI). In this work, we first investigate the application potential of the NI index by exploring its predictive potential and isomer discrimination ability. Following that, some fascinating mathematical features of NI are revealed. Extremal values of NI are estimated for the class of all trees and unicyclic graphs. Furthermore, some crucial upper bounds on NI are set up in terms of well-known graph parameters, including graph order,independence number, and vertex connectivity. Associations between NI and existing indices are also demonstrated.(c) 2022 Elsevier Inc. All rights reserved.
引用
收藏
页码:112 / 131
页数:20
相关论文
共 50 条
[1]   Interpretable multi-scale graph descriptors via structural compression [J].
Ahmed, Ammar ;
Hassan, Zohair Raza ;
Shabbir, Mudassir .
INFORMATION SCIENCES, 2020, 533 :169-180
[2]   General sum-connectivity index of unicyclic graphs with given diameter [J].
Alfuraidan, Monther Rashed ;
Das, Kinkar Chandra ;
Vetrik, Tomas ;
Balachandran, Selvaraj .
DISCRETE APPLIED MATHEMATICS, 2021, 295 :39-46
[3]  
[Anonymous], ETHERMO CALCULATION
[4]  
[Anonymous], 2016, KYOTO J MATH, V66, P701
[5]   Upper bound for the geometric-arithmetic index of trees with given domination number [J].
Bermudo, Sergio .
DISCRETE MATHEMATICS, 2023, 346 (01)
[6]   Connectivity status of fuzzy graphs [J].
Binu, M. ;
Mathew, Sunil ;
Mordeson, J. N. .
INFORMATION SCIENCES, 2021, 573 :382-395
[7]  
Bollobás B, 1998, ARS COMBINATORIA, V50, P225
[8]   Extremality of degree-based graph entropies [J].
Cao, Shujuan ;
Dehmer, Matthias ;
Shi, Yongtang .
INFORMATION SCIENCES, 2014, 278 :22-33
[9]   Graph-based structural difference analysis for video summarization [J].
Chai, Chunlei ;
Lu, Guoliang ;
Wang, Ruyun ;
Lyu, Chen ;
Lyu, Lei ;
Zhang, Peng ;
Liu, Hong .
INFORMATION SCIENCES, 2021, 577 :483-509
[10]   The expected values of Wiener indices in random polycyclic chains [J].
Chen, Hanlin ;
Li, Chao .
DISCRETE APPLIED MATHEMATICS, 2022, 315 :104-109