Computing the Number of k-Matchings in Benzenoid Chains
MATCH-COMMUNICATIONS IN MATHEMATICAL AND IN COMPUTER CHEMISTRY, cilt.88, sa.1, ss.79-92, 2022 (SCI-Expanded, Scopus)
- Yayın Türü: Makale / Tam Makale
- Cilt numarası: 88 Sayı: 1
- Basım Tarihi: 2022
- Doi Numarası: 10.46793/match.88-1.079o
- Dergi Adı: MATCH-COMMUNICATIONS IN MATHEMATICAL AND IN COMPUTER CHEMISTRY
- Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus, zbMATH
- Sayfa Sayıları: ss.79-92
- Açık Arşiv Koleksiyonu: AVESİS Açık Erişim Koleksiyonu
- Bursa Uludağ Üniversitesi Adresli: Evet
Özet
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.