| Title: | How to compute the M-polynomial of (chemical) graphs |
|---|
| Authors: | ID Deutsch, Emeric (Author)
ID Klavžar, Sandi (Author)
ID Romih, Gašper Domen (Author) |
|---|
| Files: |  PDF - Presentation file, download (376,13 KB)
MD5: 3A5B06CB7C71FF9D99E8D79ED6FD0E35
|
|---|
| Language: | English |
|---|
| Typology: | 1.01 - Original Scientific Article |
|---|
| Organization: |  IMFM - Institute of Mathematics, Physics, and Mechanics
|
|---|
| Abstract: | 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. |
|---|
| Keywords: | M-polynomial, chemical graph, planar graph |
|---|
| Publication status: | Published |
|---|
| Publication version: | Version of Record |
|---|
| Publication date: | 01.01.2023 |
|---|
| Year of publishing: | 2023 |
|---|
| Number of pages: | str. 275-285 |
|---|
| Numbering: | Vol. 89, no. 2 |
|---|
| PID: | 20.500.12556/DiRROS-18447  |
|---|
| UDC: | 519.17:54 |
|---|
| ISSN on article: | 0340-6253 |
|---|
| DOI: | 10.46793/match.89-2.275D |
|---|
| COBISS.SI-ID: | 118666243 |
|---|
| Publication date in DiRROS: | 18.03.2024 |
|---|
| Views: | 909 |
|---|
| Downloads: | 278 |
|---|
| Metadata: |    |
|---|
|
:
|
Copy citation |
|---|
| | | | Share: |  |
|---|
Hover the mouse pointer over a document title to show the abstract or click
on the title to get all document metadata. |
