Random procedures for dominating sets in graphs

Sarah Dr.rer.nat. Artmann,Frank Göring,Jochen Harant,Dieter Rautenbach,Ingo Schiermeyer

Random procedures for dominating sets in graphs

2010

Sarah Dr.rer.nat. Artmann
Frank Göring
Jochen Harant
Dieter Rautenbach
Ingo Schiermeyer

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.

Keywords:

Discrete mathematics
Probabilistic method
Random graph
Combinatorics
Domination analysis
Random regular graph
Dominating set
Mathematics
Graph

Correction
Source
Cite
Save
Machine Reading By IdeaReader

References

Citations