如何计算(化学)图的m多项式

IF 2.9 2区化学 Q2 CHEMISTRY, MULTIDISCIPLINARY

Match-Communications in Mathematical and in Computer Chemistry Pub Date : 2022-08-01 DOI:10.46793/match.89-2.275d

Emeric Deutsch, S. Klavžar, Gašper Domen Romih

{"title":"如何计算(化学)图的m多项式","authors":"Emeric Deutsch, S. Klavžar, Gašper Domen Romih","doi":"10.46793/match.89-2.275d","DOIUrl":null,"url":null,"abstract":"Let G be a graph and let m i,j ( G ), i, j ≥ 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 ) = (cid:80) i ≤ j m i,j ( G ) x i y j . A general method for calculating the M-polynomials for arbitrary graph families is presented. The method is further developed for the case where the vertices of a graph have degrees 2 and p , where p ≥ 3, and further for such planar graphs. The method is illustrated on families of chemical graphs.","PeriodicalId":51115,"journal":{"name":"Match-Communications in Mathematical and in Computer Chemistry","volume":"39 1","pages":""},"PeriodicalIF":2.9000,"publicationDate":"2022-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"How to Compute the M-Polynomial of (Chemical) Graphs\",\"authors\":\"Emeric Deutsch, S. Klavžar, Gašper Domen Romih\",\"doi\":\"10.46793/match.89-2.275d\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Let G be a graph and let m i,j ( G ), i, j ≥ 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 ) = (cid:80) i ≤ j m i,j ( G ) x i y j . A general method for calculating the M-polynomials for arbitrary graph families is presented. The method is further developed for the case where the vertices of a graph have degrees 2 and p , where p ≥ 3, and further for such planar graphs. The method is illustrated on families of chemical graphs.\",\"PeriodicalId\":51115,\"journal\":{\"name\":\"Match-Communications in Mathematical and in Computer Chemistry\",\"volume\":\"39 1\",\"pages\":\"\"},\"PeriodicalIF\":2.9000,\"publicationDate\":\"2022-08-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Match-Communications in Mathematical and in Computer Chemistry\",\"FirstCategoryId\":\"92\",\"ListUrlMain\":\"https://doi.org/10.46793/match.89-2.275d\",\"RegionNum\":2,\"RegionCategory\":\"化学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"CHEMISTRY, MULTIDISCIPLINARY\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Match-Communications in Mathematical and in Computer Chemistry","FirstCategoryId":"92","ListUrlMain":"https://doi.org/10.46793/match.89-2.275d","RegionNum":2,"RegionCategory":"化学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"CHEMISTRY, MULTIDISCIPLINARY","Score":null,"Total":0}

引用次数: 0

摘要

设G是一个图，m i,j (G)， i,j≥1，为G的边数uv，使{d v (G)， d u (G)} = {i,j}。G的M多项式是M (G;x, y) = (cid:80) i≤j m i,j (G) x i y j。给出了计算任意图族m多项式的一般方法。对于图的顶点具有2度和p度，且p≥3的情况，以及此类平面图，进一步发展了该方法。用化学图族说明了这种方法。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

How to Compute the M-Polynomial of (Chemical) Graphs

Let G be a graph and let m i,j ( G ), i, j ≥ 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 ) = (cid:80) i ≤ j m i,j ( G ) x i y j . A general method for calculating the M-polynomials for arbitrary graph families is presented. The method is further developed for the case where the vertices of a graph have degrees 2 and p , where p ≥ 3, and further for such planar graphs. The method is illustrated on families of chemical graphs.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Match-Communications in Mathematical and in Computer Chemistry 化学-化学综合

CiteScore

4.40

自引率

26.90%

发文量

审稿时长

2 months

期刊介绍： MATCH Communications in Mathematical and in Computer Chemistry publishes papers of original research as well as reviews on chemically important mathematical results and non-routine applications of mathematical techniques to chemical problems. A paper acceptable for publication must contain non-trivial mathematics or communicate non-routine computer-based procedures AND have a clear connection to chemistry. Papers are published without any processing or publication charge.