Computation of Mostar index for some graph operations
Shehnaz Akhter, Zahid Iqbal, Adnan Aslam, Wei Gao
Abstract
Abstract 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.
Topics & Concepts
Cartesian productVertex (graph theory)Lexicographical orderGraphSubdivisionProduct (mathematics)ComputationIndex (typography)JoinsGraph productMathematicsCombinatoricsDiscrete mathematicsComputer scienceGeographyChordal graphAlgorithm1-planar graphGeometryWorld Wide WebArchaeologyProgramming languageGraph theory and applicationsComputational Drug Discovery MethodsSynthesis and Properties of Aromatic Compounds