Publication: Computing the number of k-matchings in benzenoid chains
dc.contributor.author | Öz, Mert Sinan | |
dc.contributor.buuauthor | Cangül, Ismail Naci | |
dc.contributor.buuauthor | CANGÜL, İSMAİL NACİ | |
dc.contributor.department | Bursa Uludağ Üniversitesi/Fen Edebiyat Fakültesi/Matematik Bölümü. | |
dc.contributor.orcid | 0000-0002-0700-5774 | |
dc.contributor.researcherid | J-3505-2017 | |
dc.date.accessioned | 2024-09-10T06:00:48Z | |
dc.date.available | 2024-09-10T06:00:48Z | |
dc.date.issued | 2022-01-01 | |
dc.description.abstract | The Hosoya index is associated with many thermodynamic properties such as boiling point, entropy, total pi-electron energy. Transfer matrix technique is extensively utilized in mathematical chemistry for various enumeration problems. In this paper, we introduce the k-matching vector at a certain edge of graph G. Then by using the k-matching vector and two recurrence formulas, we get reduction formulas to compute k-matching number p(G, k) of any benzenoid chains for for all k >= 0 whose summation gives the Hosoya index of the chain. In conclusion, we compute p(G, k) of any benzenoid chains via an appropriate multiplication of three 4(k+ 1) x4(k+ 1) dimensional transfer matrices and a terminal vector which can be obtained by given two algorithms. | |
dc.identifier.doi | 10.46793/match.88-1.079O | |
dc.identifier.endpage | 92 | |
dc.identifier.issn | 0340-6253 | |
dc.identifier.issue | 1 | |
dc.identifier.startpage | 79 | |
dc.identifier.uri | https://doi.org/10.46793/match.88-1.079O | |
dc.identifier.uri | https://hdl.handle.net/11452/44444 | |
dc.identifier.volume | 88 | |
dc.identifier.wos | 000766653400004 | |
dc.indexed.wos | WOS.SCI | |
dc.language.iso | en | |
dc.publisher | Univ Kragujevac, Fac Science | |
dc.relation.journal | Match-communications In Mathematical And In Computer Chemistry | |
dc.relation.publicationcategory | Makale - Uluslararası Hakemli Dergi | |
dc.subject | Low-order | |
dc.subject | Operator technique | |
dc.subject | Topological index | |
dc.subject | Independent sets | |
dc.subject | Hosoya index | |
dc.subject | Polynomials | |
dc.subject | Science & technology | |
dc.subject | Physical sciences | |
dc.subject | Technology | |
dc.subject | Chemistry, multidisciplinary | |
dc.subject | Computer science, interdisciplinary applications | |
dc.subject | Mathematics, interdisciplinary applications | |
dc.subject | Chemistry | |
dc.subject | Computer science | |
dc.subject | Mathematics | |
dc.title | Computing the number of k-matchings in benzenoid chains | |
dc.type | Article | |
dspace.entity.type | Publication | |
relation.isAuthorOfPublication | 601ef81f-9bdf-4a4a-9ac1-82a82260384d | |
relation.isAuthorOfPublication.latestForDiscovery | 601ef81f-9bdf-4a4a-9ac1-82a82260384d |