Mostar index and edge Mostar index of polymers

DOI10.1007/S40314-021-01652-XMaRDI QIDQ2052298zbMATH OpenOpenAlexFDO

Authors N. Ghanbari, Saeid Alikhani

Publication date 25 November 2021

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

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://arxiv.org/abs/2106.06562

zbMATH Keywords

chainpolymerMostar indexedge Mostar index

Mathematics Subject Classification ID

Graphical indices (Wiener index, Zagreb index, Randi? index, etc.) (05C09) Chemical graph theory (05C92)

Abstract: Let $G=(V,E)$ be a graph and $e=uvinE$. Define $n_u(e,G)$ be the number of vertices of $G$ closer to $u$ than to $v$. The number $n_v(e,G)$ can be defined in an analogous way. The Mostar index of $G$ is a new graph invariant defined as $Mo(G)=su{m}_{uvinE(G)}|n_u(uv,G)-n_v(uv,G)|$. The edge version of Mostar index is defined as $M{o}_e(G)=su{m}_{e=uvinE(G)}|m_u(e|G)-m_v(G|e)|$, where $m_u(e|G)$ and $m_v(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 $G_1,ldots,G_k$ by selecting a vertex of $G_1$, a vertex of $G_2$, 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 $G_1,\mathrm{...},G_k$. 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.

Recommendations

• On Mostar and edge Mostar indices of graphs
• Mostar index: results and perspectives
• On edge Mostar index of graphs
• Sombor Index of Polymers
• Extremal phenylene chains with respect to the Mostar index

Cites work

• Computation of Gutman index of some cactus chains
• Computing the Hosoya polynomial of graphs from primary subgraphs
• Extremal bicyclic graphs with respect to Mostar index
• Mostar index
• On cacti with large Mostar index
• On edge Mostar index of graphs
• On the Number of Husimi Trees
• Sombor Index of Polymers

Cited in

(7)

• Maximizing the Mostar index for bipartite graphs and split graphs
• Sombor Index of Polymers
• scientific article; zbMATH DE number 7655727 (Why is no real title available?)
• The Mostar index of fullerenes in terms of automorphism group
• Some new results on Mostar index of graphs
• Bounding the Mostar index
• Mostar index and bounded maximum degree

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)