Counting maximal matchings in linear polymers
Presented by Prof. Tomislav DOšLIć
Type: Oral presentation
A matching $M$ in a graph $G$ is maximal if it cannot be extended to a larger matching in $G$. In this paper we show how several chemical and technical problems can be successfully modeled in terms of maximal matchings. Then we enumerate maximal matchings in several classes of graphs made by a linear or cyclic concatenation of basic building blocs. We also count maximal matchings in joins and corona products of some classes of graphs.