Some results on the inverse sum indeg index of a graph

An, Mingqiang; Xiong, Liming

doi:10.1016/j.ipl.2018.02.006

Cited by 21 publications

(6 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Some new upper bounds for the inverse sum indeg index of graphs | Akbar Ali et alAccording to(4) and(5)follows M 2 + e e ISI  ( e + e )M 2 , (6) wherefrom we obtain (3). Equality in (1) holds if and only if either a 1 = a 2 = • • • = a m , or a 1 = a 2 = • • • = a s a s+1 = • • • = a m for some s, 1  s  m 1.…”

mentioning

confidence: 70%

“…Therefore, equality in (11) holds if and only if G is regular or semiregular bipartite graph. Equalities in both (4) and (11) hold if and only if G is regular or semiregular bipartite graph. Finally, equality in (8)…”

Section: Resultsmentioning

confidence: 99%

“…The ISI index is a significant predictor of total surface area for octane isomers [35]. The problem of finding bounds on the ISI index has gained a considerable attention from researchers in recent years, for example, see [4,5,8,13,15,16,22,27,31]. In this paper, we derive several new upper bounds on the ISI index in terms of some graph parameters and above mentioned vertex-degreebased topological indices.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Some new upper bounds for the inverse sum indeg index of graphs

Ali

Matejic²,

Milovanovic³

et al. 2020

ejgta

View full text Add to dashboard Cite

Let G = (V, E) be a simple connected graph with the vertex set V = {1, 2,. .. , n} and sequence of vertex degrees (d 1 , d 2 , • • • , d n) where d i denotes the degree of a vertex i 2 V. With i ⇠ j, we denote the adjacency of the vertices i and j in the graph G. The inverse sum indeg (ISI) index of the graph G is defined as ISI(G) = P i⇠j d i d j d i +d j. Some new upper bounds for the ISI index are obtained in this paper.

show abstract

mentioning

confidence: 70%

Section: Resultsmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Some new upper bounds for the inverse sum indeg index of graphs

Ali

Matejic²,

Milovanovic³

et al. 2020

ejgta

View full text Add to dashboard Cite

show abstract

“…Imran et al [10][11][12] studied the edge Mostar index of nanostructures and chemical structures by using graph operations and also computed the eccentric connectivity polynomial of connected graphs and Mostar indices for melem chain nanostructures. For more details about topological indices, we refer the works of Xiong et al [13], Hong et al [14], Alaeiyan et al [15], Ch et al [16], and Sardar et al [17].…”

Section: Introductionmentioning

confidence: 99%

Computation of Topological Indices of Double and Strong Double Graphs of Circumcoronene Series of Benzenoid (H_m)

Sardar

Siddique

Alrowaili

et al. 2022

Journal of Mathematics

View full text Add to dashboard Cite

Topological indices are very useful to assume certain physiochemical properties of the chemical compound. A molecular descriptor which changes the molecular structures into certain real numbers is said to be a topological index. In chemical graph theory, to create quantitative structure activity relationships in which properties of molecule may be linked with their chemical structures relies greatly on topological indices. The benzene molecule is a common chemical shape in chemistry, physics, and nanoscience. This molecule could be very beneficial to synthesize fragrant compounds. The circumcoronene collection of benzenoid H m is one family that generates from benzene molecules. The purpose of this study is to calculate the topological indices of the double and strong double graphs of the circumcoronene series of benzenoids H m . In addition, we also present a numerical and graphical comparison of topological indices of the double and strong double graphs of the circumcoronene series of benzenoid H m .

show abstract

“…We suggest that readers read the following articles for more detailed information on topological indices and molecular graphs [19][20][21][22].…”

Section: Introductionmentioning

confidence: 99%

Vertex-Based Topological Indices of Double and Strong Double Graph of Dutch Windmill Graph

Ali

Sardar

Siddique

et al. 2021

Journal of Chemistry

View full text Add to dashboard Cite

A measurement of the molecular topology of graphs is known as a topological index, and several physical and chemical properties such as heat formation, boiling point, vaporization, enthalpy, and entropy are used to characterize them. Graph theory is useful in evaluating the relationship between various topological indices of some graphs derived by applying certain graph operations. Graph operations play an important role in many applications of graph theory because many big graphs can be obtained from small graphs. Here, we discuss two graph operations, i.e., double graph and strong double graph. In this article, we will compute the topological indices such as geometric arithmetic index GA , atom bond connectivity index ABC , forgotten index F , inverse sum indeg index ISI , general inverse sum indeg index ISI α , β , first multiplicative-Zagreb index PM 1 and second multiplicative-Zagreb index PM 2 , fifth geometric arithmetic index GA 5 , fourth atom bond connectivity index ABC 4 of double graph, and strong double graph of Dutch Windmill graph D 3 p .

show abstract

Some results on the inverse sum indeg index of a graph

Cited by 21 publications

References 7 publications

Some new upper bounds for the inverse sum indeg index of graphs

Some new upper bounds for the inverse sum indeg index of graphs

Computation of Topological Indices of Double and Strong Double Graphs of Circumcoronene Series of Benzenoid (H_m)

Vertex-Based Topological Indices of Double and Strong Double Graph of Dutch Windmill Graph

Contact Info

Product

Resources

About

Some results on the inverse sum indeg index of a graph

Cited by 21 publications

References 7 publications

Some new upper bounds for the inverse sum indeg index of graphs

Some new upper bounds for the inverse sum indeg index of graphs

Computation of Topological Indices of Double and Strong Double Graphs of Circumcoronene Series of Benzenoid (Hm)

Vertex-Based Topological Indices of Double and Strong Double Graph of Dutch Windmill Graph

Contact Info

Product

Resources

About

Computation of Topological Indices of Double and Strong Double Graphs of Circumcoronene Series of Benzenoid (H_m)