The Number of Maximal Matchings in Polyphenylene Chains
نویسندگان
1 Department of Mathematics, Grand Valley State University, Allendale, MI, USA
2 Department of Mathematics, Grand Valley State University, Allendale, MI, USA
doi
10.22052/ijmc.2019.191800.1447چکیده
A matching is maximal if no other matching contains it as a proper subset. Maximal matchings model phenomena across many disciplines, including applications within chemistry. In this paper, we study maximal matchings in an important class of chemical compounds: polyphenylenes. In particular, we determine the extremal polyphenylene chains in regards to the number of maximal matchings. We also determine recurrences and generating functions for the sequences enumerating maximal matchings in several specific types of polyphenylenes and use these results to analyze the asymptotic behavior.