Release Time:2019-03-11  Hits:

Indexed by: Journal Article

Date of Publication: 2009-01-01

Journal: International Journal of Pure and Applied Mathematics

Included Journals: Scopus

Volume: 50

Issue: 4

Page Number: 553-558

ISSN: 13118080

Abstract: 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.