Counting Matchings in Caterpillar Graphs with an Application to a Class of Benzenoid Chains
Match Communications in Mathematical and in Computer Chemistry · 05.05.2026 · 97 (1) · 243
DOI: 10.46793/match.97-1.13326 ↗Kurz gefasst
Fachartikel in der Zeitschrift Match Communications in Mathematical and in Computer Chemistry, online erschienen am 05.05.2026. Verfasst von Hülya Buksur Köleli und 1 weiteren Autor:innen. Die Arbeit nennt 20 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).
Abstract (Originalsprache)
Total number of matchings is called Hosoya index in graph theory. Although Hosoya index was introduced in 1971, the relations between the Hosoya index of caterpillar graphs and Euler’s continuants were introduced in 2007. In this paper, we show that the Hosoya index of caterpillar graphs can be computed as product of 2 × 2 matrices. Moreover, we obtain that Hosoya index of the caterpillar graphs Z(Cn(x, . . . , x)) equals to (n + 1) − th Fibonacci polynomial and we show that the Hosoya index of the caterpillar graphs Z(Cn(x + 1, . . . , x + 1)) can be shown in a polynomial form with the coefficients as a Pell triangle of Reference number A038137 in OEIS. Finally, we use these relations in the computation of the Kekul´e number of a class Hn,x of benzenoid chains which have n segments of length x.
Zitieren
APA
Köleli, H. B., & Şahin, B. (2026). Counting Matchings in Caterpillar Graphs with an Application to a Class of Benzenoid Chains. Match Communications in Mathematical and in Computer Chemistry, 97(1), 243. https://doi.org/10.46793/match.97-1.13326
Vancouver
Köleli HB, Şahin B. Counting Matchings in Caterpillar Graphs with an Application to a Class of Benzenoid Chains. Match Communications in Mathematical and in Computer Chemistry. 2026;97(1):243. doi:10.46793/match.97-1.13326
BibTeX
@article{Kleli2026,
author = {Köleli, Hülya Buksur and Şahin, Bünyamin},
title = {Counting Matchings in Caterpillar Graphs with an Application to a Class of Benzenoid Chains},
journal = {Match Communications in Mathematical and in Computer Chemistry},
year = {2026},
volume = {97},
number = {1},
pages = {243},
doi = {10.46793/match.97-1.13326}
}
EUVIMED