Weak edge-degree domination in hypergraphs
Czechoslovak Mathematical Journal, Tome 56 (2006) no. 1, pp. 99-108
Voir la notice de l'article provenant de la source Czech Digital Mathematics Library
In this paper we extend the notion of weak degree domination in graphs to hypergraphs and find relationships among the domination number, the weak edge-degree domination number, the independent domination number and the independence number of a given hypergraph.
Classification :
05C65, 05C69
Keywords: hypergraph; weak degree domination number; independent domination number; graph theory
Keywords: hypergraph; weak degree domination number; independent domination number; graph theory
@article{CMJ_2006__56_1_a7,
author = {Acharya, Belmannu Devadas and Gupta, Purnima},
title = {Weak edge-degree domination in hypergraphs},
journal = {Czechoslovak Mathematical Journal},
pages = {99--108},
publisher = {mathdoc},
volume = {56},
number = {1},
year = {2006},
mrnumber = {2206289},
zbl = {1164.05415},
language = {en},
url = {http://geodesic.mathdoc.fr/item/CMJ_2006__56_1_a7/}
}
Acharya, Belmannu Devadas; Gupta, Purnima. Weak edge-degree domination in hypergraphs. Czechoslovak Mathematical Journal, Tome 56 (2006) no. 1, pp. 99-108. http://geodesic.mathdoc.fr/item/CMJ_2006__56_1_a7/