20.500.12556/DiRROS-18447 How to compute the M-polynomial of (chemical) graphs Let $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. M-polynomial chemical graph planar graph M-polinom kemijski graf ravninski graf true false true Angleški jezik Slovenski jezik Neznano 2024-03-18 12:20:32 2024-03-18 12:20:33 2024-03-19 03:44:38 0000-00-00 00:00:00 2023 0 0 str. 275-285 no. 2 Vol. 89 2023 0000-00-00 Zaloznikova Objavljeno NiDoloceno 0000-00-00 0000-00-00 2023-01-01 519.17:54 0340-6253 10.46793/match.89-2.275D 118666243 match89n2_275-285.pdf match89n2_275-285.pdf 1 3A5B06CB7C71FF9D99E8D79ED6FD0E35 e7d83f1266afe9397b5cf191b739a52b883846e6a2243e954636add1ffd167f3 89ef1b85-e519-11ee-9dd4-001a4af901a5 https://dirros.openscience.si/Dokument.php?lang=slv&id=25125 Inštitut za matematiko, fiziko in mehaniko 0 0 0