2019
DOI: 10.1002/qua.26043
|View full text |Cite
|
Sign up to set email alerts
|

Mostar indices of carbon nanostructures and circumscribed donut benzenoid systems

Abstract: On the great success of bond‐additive topological indices such as Szeged, Padmakar‐Ivan, Zagreb, and irregularity measures, yet another index, the Mostar index, has been introduced recently as a quantitative refinement of the distance nonbalancedness and also a peripherality measure in molecular graphs and networks. In this direction, we introduce other variants of bond‐additive indices, such as edge‐Mostar and total‐Mostar indices. The present article explores a computational technique for Mostar, edge‐Mostar… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

0
67
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
6

Relationship

2
4

Authors

Journals

citations
Cited by 78 publications
(67 citation statements)
references
References 18 publications
0
67
0
Order By: Relevance
“…The formulae of several topological indices ( TI ) of a strength‐weighted graph G sw that are analyzed in this study are tabulated in Table 1, where TI ( G sw ) = TI ( G ) if w v = 1, s v = 0, w e = 1, and s e = 1. The computational techniques for evaluating these indices continues to be an interesting topic of research [ 23–25,31 ] because it facilitates the topological characterization without actually calculating the numerical parameters of the graph. The cut method is a classical computational procedure [ 31 ] employed to investigate topological indices and is being continuously revamped based on the kind of graphs.…”
Section: Mathematical Preliminariesmentioning
confidence: 99%
See 1 more Smart Citation
“…The formulae of several topological indices ( TI ) of a strength‐weighted graph G sw that are analyzed in this study are tabulated in Table 1, where TI ( G sw ) = TI ( G ) if w v = 1, s v = 0, w e = 1, and s e = 1. The computational techniques for evaluating these indices continues to be an interesting topic of research [ 23–25,31 ] because it facilitates the topological characterization without actually calculating the numerical parameters of the graph. The cut method is a classical computational procedure [ 31 ] employed to investigate topological indices and is being continuously revamped based on the kind of graphs.…”
Section: Mathematical Preliminariesmentioning
confidence: 99%
“…The cut method is a classical computational procedure [ 31 ] employed to investigate topological indices and is being continuously revamped based on the kind of graphs. [ 23,25–27 ] In this method, the key role is played by the Djokovic ′ ‐Winkler relation Θ, cf. Klavžar and Nadjafi‐Arani [ 31 ] This relation is defined on the edge set of a given graph G , where edges e = uv and f = ab of G are in relation Θ if d G ( v , b ) + d G ( u , a ) d G ( u , b ) + d G ( v , a ).…”
Section: Mathematical Preliminariesmentioning
confidence: 99%
“…Arockiaraj et al proposed the accurate values of the Mostar index for the family of carbon nanocone and coronoid structures in ref. [18]. Arockiaraj et al [ 19 ] calculated the weighted Mostar indices of molecular peripheral shapes with applications in graphene, graphyne, and graphdiyne nanoribbons.…”
Section: Introductionmentioning
confidence: 99%
“…The edge version of the Mostar index was introduced by Arockiaraj et al [ 18 ] as follows: Moe()scriptYl=e=ylyl0.25em0.25emnormalε()scriptYl|||mnormalyl()|escriptYlmnormalylfalse(eYlfalse). where mnormalyl()|escriptYl is the cardinality of edges closer to y l than yl, and mnormalyl()|escriptYl is the cardinality of edges closer to yl than y l . The term irregularity of a graph Yl was put forward by Albertson.…”
Section: Introductionmentioning
confidence: 99%
“…Recently, the other versions of Mostar index named as edge-Mostar and total-Mostar indices were introduced by Arockiaraj et al [25]. These indices are described for S as follows:…”
Section: Introductionmentioning
confidence: 99%