Random Procedures for Dominating Sets in Graphs

  • Sarah Artmann
  • Frank Göring
  • Jochen Harant
  • Dieter Rautenbach
  • Ingo Schiermeyer
DOI: https://doi.org/10.37236/374

Abstract

We present and analyze some random procedures for the construction of small dominating sets in graphs. Several upper bounds for the domination number of a graph are derived from these procedures.

Published
2010-07-20
How to Cite
Artmann, S., Göring, F., Harant, J., Rautenbach, D., & Schiermeyer, I. (2010). Random Procedures for Dominating Sets in Graphs. The Electronic Journal of Combinatorics, 17(1), R102. https://doi.org/10.37236/374
Issue
Volume 17 (2010)
Article Number
R102