Extremal graphs for average sizes of maximal matchings

DOI10.1016/j.dam.2023.08.022OpenAlexW4386491322MaRDI QIDQ6069175

John Engbers, Aysel Erey

Publication date: 13 November 2023

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2023.08.022

zbMATH Keywords

treemaximal matchingunicyclic graphaverage graph parameter

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• Unnamed Item
• On the number of matchings of a tree
• The average size of a connected vertex set of a \(k\)-connected graph
• On the average order of a dominating set of a forest
• The maximum average connectivity among all orientations of a graph
• Global forcing number for maximal matchings in corona products
• The average size of matchings in graphs
• The average size of independent sets of graphs
• Counting maximal matchings in linear polymers
• Edge Dominating Sets in Graphs
• The Number of Maximal Matchings in Polyphenylene Chains
• Maximal matchings in polyspiro and benzenoid chains
• On the mean subtree order of graphs under edge addition