Premium
Computation of Mostar index for some graph operations
Author(s) -
Akhter Shehnaz,
Iqbal Zahid,
Aslam Adnan,
Gao Wei
Publication year - 2021
Publication title -
international journal of quantum chemistry
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.484
H-Index - 105
eISSN - 1097-461X
pISSN - 0020-7608
DOI - 10.1002/qua.26674
Subject(s) - cartesian product , vertex (graph theory) , lexicographical order , graph , subdivision , product (mathematics) , computation , index (typography) , joins , graph product , mathematics , combinatorics , discrete mathematics , computer science , geography , chordal graph , algorithm , 1 planar graph , geometry , programming language , archaeology , world wide web
Very recently, a novel bond‐additive topological descriptor named as the Mostar index has been proposed as a measure of peripherality in networks and graphs. In this article, we compute the Mostar index of generalized Hierarchical product, lexicographic product, Cartesian product, corona product, join, subdivision vertex‐edge join and Indu–Bala products of graphs and apply these results to determine the Mostar index of some types of nanostructures and chemical graphs. As an application, we give the explicit expressions for the Mostar index of various nanostructures and chemical graphs.