Publication:
Computing the number of k-matchings in benzenoid chains

dc.contributor.authorÖz, Mert Sinan
dc.contributor.buuauthorCangül, Ismail Naci
dc.contributor.buuauthorCANGÜL, İSMAİL NACİ
dc.contributor.departmentBursa Uludağ Üniversitesi/Fen Edebiyat Fakültesi/Matematik Bölümü.
dc.contributor.orcid0000-0002-0700-5774
dc.contributor.researcheridJ-3505-2017
dc.date.accessioned2024-09-10T06:00:48Z
dc.date.available2024-09-10T06:00:48Z
dc.date.issued2022-01-01
dc.description.abstractThe 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.doi10.46793/match.88-1.079O
dc.identifier.endpage92
dc.identifier.issn0340-6253
dc.identifier.issue1
dc.identifier.startpage79
dc.identifier.urihttps://doi.org/10.46793/match.88-1.079O
dc.identifier.urihttps://hdl.handle.net/11452/44444
dc.identifier.volume88
dc.identifier.wos000766653400004
dc.indexed.wosWOS.SCI
dc.language.isoen
dc.publisherUniv Kragujevac, Fac Science
dc.relation.journalMatch-communications In Mathematical And In Computer Chemistry
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi
dc.subjectLow-order
dc.subjectOperator technique
dc.subjectTopological index
dc.subjectIndependent sets
dc.subjectHosoya index
dc.subjectPolynomials
dc.subjectScience & technology
dc.subjectPhysical sciences
dc.subjectTechnology
dc.subjectChemistry, multidisciplinary
dc.subjectComputer science, interdisciplinary applications
dc.subjectMathematics, interdisciplinary applications
dc.subjectChemistry
dc.subjectComputer science
dc.subjectMathematics
dc.titleComputing the number of k-matchings in benzenoid chains
dc.typeArticle
dspace.entity.typePublication
relation.isAuthorOfPublication601ef81f-9bdf-4a4a-9ac1-82a82260384d
relation.isAuthorOfPublication.latestForDiscovery601ef81f-9bdf-4a4a-9ac1-82a82260384d

Files

Collections