Maximal independent sets and maximal matchings in series-parallel and related graph classes (Q2288167)

Summary: The goal of this paper is to obtain quantitative results on the number and on the size of maximal independent sets and maximal matchings in several block-stable graph classes that satisfy a proper sub-criticality condition. In particular we cover trees, cacti graphs and series-parallel graphs. The proof methods are based on a generating function approach and a proper singularity analysis of solutions of implicit systems of functional equations in several variables. As a byproduct, this method extends previous results of \textit{A. Meir} and \textit{J. W. Moon} [J. Graph Theory 12, No. 2, 265--283 (1988; Zbl 0655.05039)] for trees.