Mostar index and edge Mostar index of polymers
From MaRDI portal
Publication:2052298
DOI10.1007/S40314-021-01652-XzbMATH Open1476.05030arXiv2106.06562OpenAlexW3203828852MaRDI QIDQ2052298FDOQ2052298
Publication date: 25 November 2021
Published in: Computational and Applied Mathematics (Search for Journal in Brave)
Abstract: Let be a graph and . Define be the number of vertices of closer to than to . The number can be defined in an analogous way. The Mostar index of is a new graph invariant defined as . The edge version of Mostar index is defined as , where and are the number of edges of lying closer to vertex than to vertex and the number of edges of lying closer to vertex than to vertex , respectively. Let be a connected graph constructed from pairwise disjoint connected graphs by selecting a vertex of , a vertex of , and identifying these two vertices. Then continue in this manner inductively. We say that is a polymer graph, obtained by point-attaching from monomer units . In this paper, we consider some particular cases of these graphs that are of importance in chemistry and study their Mostar and edge Mostar indices.
Full work available at URL: https://arxiv.org/abs/2106.06562
Recommendations
Graphical indices (Wiener index, Zagreb index, Randi? index, etc.) (05C09) Chemical graph theory (05C92)
Cites Work
Cited In (5)
This page was built for publication: Mostar index and edge Mostar index of polymers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2052298)