Some remarks on α-domination
Discussiones Mathematicae. Graph Theory, Tome 24 (2004) no. 3, pp. 423-430
Voir la notice de l'article provenant de la source Library of Science
Let α ∈ (0,1) and let G = (V_G,E_G) be a graph. According to Dunbar, Hoffman, Laskar and Markus [3] a set D ⊆ V_G is called an α-dominating set of G, if |N_G(u) ∩ D| ≥ αd_G(u) for all u ∈ V_G∖D. We prove a series of upper bounds on the α-domination number of a graph G defined as the minimum cardinality of an α-dominating set of G.
Keywords:
α-domination, domination
@article{DMGT_2004_24_3_a5,
author = {Dahme, Franz and Rautenbach, Dieter and Volkmann, Lutz},
title = {Some remarks on \ensuremath{\alpha}-domination},
journal = {Discussiones Mathematicae. Graph Theory},
pages = {423--430},
publisher = {mathdoc},
volume = {24},
number = {3},
year = {2004},
language = {en},
url = {http://geodesic.mathdoc.fr/item/DMGT_2004_24_3_a5/}
}
Dahme, Franz; Rautenbach, Dieter; Volkmann, Lutz. Some remarks on α-domination. Discussiones Mathematicae. Graph Theory, Tome 24 (2004) no. 3, pp. 423-430. http://geodesic.mathdoc.fr/item/DMGT_2004_24_3_a5/