Random procedures for dominating sets in graphs

Artmann, Sarah GND; Göring, Frank; Harant, Jochen GND; Rautenbach, Dieter; Schiermeyer, Ingo

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.

Cite

Citation style:
Artmann Dr.rer.nat., S., Göring Dr. rer. nat., F., Harant Prof. Dr. rer. nat. habil., J., Rautenbach Prof. Dr. rer. nat. habil., D., Schiermeyer Prof. Dr., I., 2008. Random procedures for dominating sets in graphs. Preprint /  Technische Universität Ilmenau, Institut für Mathematik, Preprint /  Technische Universität Ilmenau, Institut für Mathematik 08–10.
Could not load citation form. Default citation form is displayed.

Rights

Use and reproduction:
All rights reserved

Export