Bounding and approximating minimum maximal matchings in regular graphs
Combinatorics
2019-05-30 v1
Abstract
The edge domination number of a graph is the minimum size of a maximal matching in . It is well known that this parameter is computationally very hard, and several approximation algorithms and heuristics have been studied. In the present paper, we provide best possible upper bounds on for regular and non-regular graphs in terms of their order and maximum degree. Furthermore, we discuss algorithmic consequences of our results and their constructive proofs.
Cite
@article{arxiv.1905.12241,
title = {Bounding and approximating minimum maximal matchings in regular graphs},
author = {Julien Baste and Maximilian Fürst and Michael A. Henning and Elena Mohr and Dieter Rautenbach},
journal= {arXiv preprint arXiv:1905.12241},
year = {2019}
}