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.
為了持續優化網站功能與使用者體驗,本網站將Cookies分析技術用於網站營運、分析和個人化服務之目的。
若您繼續瀏覽本網站,即表示您同意本網站使用Cookies。