Counting maximal matchings in linear polymers

Tomislav Došlić, Ivana Zubac

Abstract


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. We introduce the maximal matching polynomial and study its basic properties. 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.


Keywords


Maximal matching, maximal matching polynomial, cactus graph, cactus chain, Padovan numbers, Perrin numbers, corona product

Full Text:

PDF ABSTRACTS (EN/SI)


DOI: https://doi.org/10.26493/1855-3974.851.167

ISSN: 1855-3974

Issues from Vol 6, No 1 onward are partially supported by the Slovenian Research Agency from the Call for co-financing of scientific periodical publications