Mostar index and edge Mostar index of polymers

From MaRDI portal
Publication:2052298

DOI10.1007/S40314-021-01652-XzbMATH Open1476.05030arXiv2106.06562OpenAlexW3203828852MaRDI QIDQ2052298FDOQ2052298

Saeid Alikhani, N. Ghanbari

Publication date: 25 November 2021

Published in: Computational and Applied Mathematics (Search for Journal in Brave)

Abstract: Let G=(V,E) be a graph and e=uvinE. Define nu(e,G) be the number of vertices of G closer to u than to v. The number nv(e,G) can be defined in an analogous way. The Mostar index of G is a new graph invariant defined as Mo(G)=sumuvinE(G)|nu(uv,G)nv(uv,G)|. The edge version of Mostar index is defined as Moe(G)=sume=uvinE(G)|mu(e|G)mv(G|e)|, where mu(e|G) and mv(e|G) are the number of edges of G lying closer to vertex u than to vertex v and the number of edges of G lying closer to vertex v than to vertex u, respectively. Let G be a connected graph constructed from pairwise disjoint connected graphs G1,ldots,Gk by selecting a vertex of G1, a vertex of G2, and identifying these two vertices. Then continue in this manner inductively. We say that G is a polymer graph, obtained by point-attaching from monomer units G1,...,Gk. 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




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)