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

We provide combinatorial decompositions as well as asymptotic tight estimates for two maximal parameters: the number and average size of maximal independent sets and maximal matchings in seriesparallel graphs (and related graph classes) with n vertices. In particular, our results extend previous results of Meir and Moon for trees [Meir, Moon: On maximal independent sets of nodes in trees, Journal of Graph Theory 1988]. We also show that these two parameters converge to a central limit law.Postprint (author's final draft

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

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 seriesparallel 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 Meir and Moon for trees [Meir, Moon: On maximal independent sets of nodes in trees, Journal of Graph Theory 1988].Postprint (author's final draft

Maximal Independent Sets and Maximal Matchings in Series-Parallel and Related Graph Classes

We provide combinatorial decompositions as well as asymptotic tight estimates for two maximal parameters: the number and average size of maximal independent sets and maximal matchings in series-parallel graphs (and related graph classes) with n vertices. In particular, our results extend previous results of Meir and Moon for trees [Meir, Moon: On maximal independent sets of nodes in trees, Journal of Graph Theory 1988]. We also show that these two parameters converge to a central limit law

Informe bibliomètric bimestral Campus Baix Llobregat. Base de dades Scopus. Juliol-agost 2018

Informe bibliomètric bimestral Campus Baix Llobregat. Base de dades Scopus. Data de la cerca 31/08/2018Postprint (author's final draft

Articles publicats en accés obert al Campus del Baix Llobregat

Amb motiu de la setmana mundial de l'accés obert (Open Access Week 2020) presentem aquest document amb els articles publicats en accés obert per autors del Campus del Baix Llobregat.Postprint (published version

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

We provide combinatorial decompositions as well as asymptotic tight estimates for two maximal parameters: the number and average size of maximal independent sets and maximal matchings in seriesparallel graphs (and related graph classes) with n vertices. In particular, our results extend previous results of Meir and Moon for trees [Meir, Moon: On maximal independent sets of nodes in trees, Journal of Graph Theory 1988]. We also show that these two parameters converge to a central limit law