Sharp Bounds for the Inverse Sum Indeg Index of Graph Operations - Sorbonne Université
Journal Articles Mathematical Problems in Engineering Year : 2021

Sharp Bounds for the Inverse Sum Indeg Index of Graph Operations

Abstract

Vukičević and Gasperov introduced the concept of 148 discrete Adriatic indices in 2010. ese indices showed good predictive properties against the testing sets of the International Academy of Mathematical Chemistry. Among these indices, twenty indices were taken as beneficial predictors of physicochemical properties. e inverse sum indeg index denoted by ISI(G k) of G k is a notable predictor of total surface area for octane isomers and is presented as ISI(G k) = g k g k ′ ∈E(G k) (d G k (g k)d G k (g k ′)/d G k (g k) + d G k (g k ′)), where d G k (g k) represents the degree of g k ∈ V(G k). In this paper, we determine sharp bounds for ISI index of graph operations, including the Cartesian product, tensor product, strong product, composition, disjunction, symmetric difference, corona product, Indu-Bala product, union of graphs, double graph, and strong double graph.
Fichier principal
Vignette du fichier
5561033.pdf (1.26 Mo) Télécharger le fichier
Origin Publication funded by an institution

Dates and versions

hal-03284085 , version 1 (12-07-2021)

Identifiers

Cite

Anam Rani, Muhammad Imran, Usman Ali. Sharp Bounds for the Inverse Sum Indeg Index of Graph Operations. Mathematical Problems in Engineering, 2021, 2021, pp.5561033. ⟨10.1155/2021/5561033⟩. ⟨hal-03284085⟩
22 View
26 Download

Altmetric

Share

More