Maximal matchings in polyspiro and benzenoid chains

Autor:	Taylor Short, Tomislav Došlić
Rok vydání:	2015
Předmět:	Combinatorics Maximal matching Benzenoid chain Polyspiro chain Matching (graph theory) Linear polymer Applied Mathematics FOS: Mathematics Discrete Mathematics and Combinatorics Graph (abstract data type) Mathematics - Combinatorics Combinatorics (math.CO) Analysis Mathematics
DOI:	10.48550/arxiv.1511.00590
Popis:	A matching $M$ of a graph $G$ is maximal if it is not a proper subset of any other matching in $G$. Maximal matchings are much less known and researched than their maximum and perfect counterparts. In particular, almost nothing is known about their enumerative properties. In this paper we present the recurrences and generating functions for the sequences enumerating maximal matchings in two classes of chemically interesting linear polymers: polyspiro chains and benzenoid chains. We also analyze the asymptotic behavior of those sequences and determine the extremal cases. Comment: 22 pages, 17 figures
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5ce82a4c838794029101bbc01f022042 Zobrazit plný text záznamu