Geodesic
Random procedures for dominating sets in graphs
The electronic journal of combinatorics, Tome 17 (2010)
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

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.
DOI : 10.37236/374
Classification : 05C69
Mots-clés : domination, independence, probabilistic method 
@article{10_37236_374,
     author = {Sarah Artmann and Frank G\"oring and Jochen Harant and Dieter Rautenbach and Ingo Schiermeyer},
     title = {Random procedures for dominating sets in graphs},
     journal = {The electronic journal of combinatorics},
     year = {2010},
     volume = {17},
     doi = {10.37236/374},
     zbl = {1230.05222},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/374/}
}
TY  - JOUR
AU  - Sarah Artmann
AU  - Frank Göring
AU  - Jochen Harant
AU  - Dieter Rautenbach
AU  - Ingo Schiermeyer
TI  - Random procedures for dominating sets in graphs
JO  - The electronic journal of combinatorics
PY  - 2010
VL  - 17
UR  - http://geodesic.mathdoc.fr/articles/10.37236/374/
DO  - 10.37236/374
ID  - 10_37236_374
ER  - 
%0 Journal Article
%A Sarah Artmann
%A Frank Göring
%A Jochen Harant
%A Dieter Rautenbach
%A Ingo Schiermeyer
%T Random procedures for dominating sets in graphs
%J The electronic journal of combinatorics
%D 2010
%V 17
%U http://geodesic.mathdoc.fr/articles/10.37236/374/
%R 10.37236/374
%F 10_37236_374
Sarah Artmann; Frank Göring; Jochen Harant; Dieter Rautenbach; Ingo Schiermeyer. Random procedures for dominating sets in graphs. The electronic journal of combinatorics, Tome 17 (2010). doi: 10.37236/374

Cité par Sources :