Open AccessComplementary nil domination number of a graph
Author(s) -
T. Tamizh Chelvam,
S. Robinson Chellathurai
Publication year - 2009
Publication title -
tamkang journal of mathematics
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.324
H-Index - 18
eISSN - 0049-2930
pISSN - 2073-9826
DOI - 10.5556/j.tkjm.40.2009.465
Subject(s) - dominating set , domination analysis , mathematics , combinatorics , complement (music) , graph , cardinality (data modeling) , set (abstract data type) , discrete mathematics , connected dominating set , computer science , vertex (graph theory) , data mining , biochemistry , chemistry , complementation , programming language , gene , phenotype
A set ${Ssubseteq 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 ${gamma}_{m cnd}(G)$. In this paper some results on the complementary nil domination number are obtained