How to compute the M-polynomial of (chemical) graphsDeutsch, Emeric (Avtor) Klavžar, Sandi (Avtor) Romih, Gašper Domen (Avtor) M-polynomialchemical graphplanar graphLet $G$ be a graph and let $m_{i,j}(G)$, $i,j\ge 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_{i\le j} m_{i,j}(G)x^iy^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\ge 3$, and further for such planar graphs. The method is illustrated on families of chemical graphs.20232024-03-18 12:20:32Neznano18447UDK: 519.17:54ISSN pri članku: 0340-6253DOI: 10.46793/match.89-2.275DCOBISS_ID: 118666243sl