On the M-polynomial of planar chemical graphs

IF 1 Q4 CHEMISTRY, MULTIDISCIPLINARY
Emeric Deutsch, S. Klavžar
{"title":"On the M-polynomial of planar chemical graphs","authors":"Emeric Deutsch, S. Klavžar","doi":"10.22052/IJMC.2020.224280.1492","DOIUrl":null,"url":null,"abstract":"Let $G$ be a graph and let $m_{i,j}(G)$, $i,jge 1$, be the number of edges $uv$ of $G$ such that ${d_v(G), d_u(G)} = {i,j}$. The $M$-polynomial of $G$ is $M(G;x,y) = sum_{ile j} m_{i,j}(G)x^iy^j$. With $M(G;x,y)$ in hands, numerous degree-based topological indices of $G$ can be routinely computed. In this note a formula for the $M$-polynomial of planar (chemical) graphs which have only vertices of degrees $2$ and $3$ is given that involves only invariants related to the degree $2$ vertices and the number of faces. The approach is applied on several families of chemical graphs. In one of these families an error from the literature is corrected.","PeriodicalId":14545,"journal":{"name":"Iranian journal of mathematical chemistry","volume":null,"pages":null},"PeriodicalIF":1.0000,"publicationDate":"2020-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"10","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Iranian journal of mathematical chemistry","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.22052/IJMC.2020.224280.1492","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"CHEMISTRY, MULTIDISCIPLINARY","Score":null,"Total":0}
引用次数: 10

Abstract

Let $G$ be a graph and let $m_{i,j}(G)$, $i,jge 1$, be the number of edges $uv$ of $G$ such that ${d_v(G), d_u(G)} = {i,j}$. The $M$-polynomial of $G$ is $M(G;x,y) = sum_{ile j} m_{i,j}(G)x^iy^j$. With $M(G;x,y)$ in hands, numerous degree-based topological indices of $G$ can be routinely computed. In this note a formula for the $M$-polynomial of planar (chemical) graphs which have only vertices of degrees $2$ and $3$ is given that involves only invariants related to the degree $2$ vertices and the number of faces. The approach is applied on several families of chemical graphs. In one of these families an error from the literature is corrected.
平面化学图的m -多项式
设$G$是一个图,设$m_{i,j}(G)$, $i,jge 1$是$G$的边数$uv$,使得${d_v(G), d_u(G)} = {i,j}$。的M多项式美元G M美元美元(G, x, y) = sum_ {ile j} m_ {i, j} (G) x美元iy ^ ^ j。有了$M(G;x,y)$,就可以常规地计算$G$的许多基于度的拓扑指标。本文给出了只包含$2$顶点和$3$顶点的平面(化学)图的$M$-多项式的公式,该公式只涉及与$2$顶点和面数相关的不变量。该方法应用于几个化学图族。在其中一个科中,文献中的一个错误被纠正了。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Iranian journal of mathematical chemistry
Iranian journal of mathematical chemistry CHEMISTRY, MULTIDISCIPLINARY-
CiteScore
2.10
自引率
7.70%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信