dc.contributor.author | Ghanbari, Nima | |
dc.contributor.author | Alikhani, Saeid | |
dc.date.accessioned | 2021-10-08T06:48:14Z | |
dc.date.available | 2021-10-08T06:48:14Z | |
dc.date.created | 2021-10-07T10:49:46Z | |
dc.date.issued | 2021 | |
dc.identifier.issn | 2238-3603 | |
dc.identifier.uri | https://hdl.handle.net/11250/2788568 | |
dc.description.abstract | Let G=(V,E) be a graph and e=uv∈E. 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)=∑uv∈E(G)|nu(uv,G)−nv(uv,G)|. The edge version of Mostar index is defined as Moe(G)=∑e=uv∈E(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,…,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. | en_US |
dc.language.iso | eng | en_US |
dc.publisher | Springer | en_US |
dc.relation.uri | https://link.springer.com/article/10.1007/s40314-021-01652-x | |
dc.rights | Navngivelse 4.0 Internasjonal | * |
dc.rights.uri | http://creativecommons.org/licenses/by/4.0/deed.no | * |
dc.title | Mostar index and edge Mostar index of polymers | en_US |
dc.type | Journal article | en_US |
dc.type | Peer reviewed | en_US |
dc.description.version | publishedVersion | en_US |
dc.rights.holder | Copyright The Author(s) 2021 | en_US |
dc.source.articlenumber | 260 | en_US |
cristin.ispublished | true | |
cristin.fulltext | original | |
cristin.qualitycode | 1 | |
dc.identifier.doi | https://doi.org/10.1007/s40314-021-01652-x | |
dc.identifier.cristin | 1944070 | |
dc.source.journal | Computational & Applied Mathemathics | en_US |
dc.identifier.citation | Computational & Applied Mathemathics. 2021, 40, 260. | en_US |
dc.source.volume | 40 | en_US |