Counting maximal matchings in linear polymers
Došlić, Tomislav ; Zubac, Ivana
ARS MATHEMATICA CONTEMPORANEA, Tome 11 (2015), / Harvested from ARS MATHEMATICA CONTEMPORANEA
link
link
link

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.

Publié le : 2015-01-01
DOI : https://doi.org/10.26493/1855-3974.851.167 
@article{851,
     title = {Counting maximal matchings in linear polymers},
     journal = {ARS MATHEMATICA CONTEMPORANEA},
     volume = {11},
     year = {2015},
     doi = {10.26493/1855-3974.851.167},
     language = {EN},
     url = {http://dml.mathdoc.fr/item/851}
}

Došlić, Tomislav; Zubac, Ivana. Counting maximal matchings in linear polymers. ARS MATHEMATICA CONTEMPORANEA, Tome 11 (2015) . doi : 10.26493/1855-3974.851.167. http://gdmltest.u-ga.fr/item/851/