点击次数：

论文类型：期刊论文

发表时间：2009-01-01

发表刊物：International Journal of Pure and Applied Mathematics

收录刊物：Scopus

卷号：50

期号：4

页面范围：553-558

ISSN号：13118080

摘要：Let G = (V(G), E(G)) be a graph. A set S ? V(G) is a dominating set if every vertex of V(G)-S is adjacent to some vertices in S. The domination number   (G) of G is the minimum cardinality of a dominating set of G. In this paper, we study the domination number of Kn?del graph W3,n and prove that for n    8   (W(3,n)) = 2[n/8] + { 0, n = 0 mod 8, 1, n = 2 mod 8, 2, n = 4, 6 mod 8. ? 2009 Academic Publications.