Complementary Nil Domination Number of a Graph

T. Tamizh Chelvam；S. Robinson Chellathurai

Domination number ； split domination number ； independence number ； uniform domination number and enclave

Tamkang Journal of Mathematics

40卷2期（2009 / 06 / 01）

165 - 172

英文

A set S⊆V is said to be a complementary nil dominating set of a graph G if it is a dominating set and its complement V-S is not a dominating set for G. The minimum cardinality of a cnd-set is called the complementary nil domination number of G and is denoted by γand(G). In this paper some results on the complementary nil domination number are obtained.