Certain domination numbers for Cartesian product of graphs

Abstract

Let G be a network, any node v∈V(G)\D is adjacent to atleast one node in D, then the set D is named a dominating set, represented by g (G). A set D of nodes in a network G is called an independent dominating set if D is an independent set. A total dominating set of a network G is a set D of nodes such that every nodes in G is adjacent to a node in D. A dominating set D of G is called paired dominating set whose induced graph of D contains a perfect matching. A 2-dominating set of a network G is a dominating set, in which any node not in D has minimum two neighbours in D. The minimal size of a 2-dominating set of G denoted by 2g (G), is the 2-domination number of G. In this paper, we obtain certain domination parameters, such as domination, independent domination, total domination and paired domination numbers for the class of Cartesian product of cycle , m C and circulant graph (6;{1,2})Gn± and (8;{1,2,3}),Gn± where 0 (mod 4),m≡ 1n≥ and there by proving that the cardinality of all parameters are same for the above graphs. And also we obtain 2-domination number for the Cartesian product of cycle ,mC and circulant graph (2;{1,2}),nG± with 0 (mod 4),m≡ and Cartesian product of cycle ,mC and circulant graph (2;{1,3}),nG± with 0,2 (mod 4),m≡ 3,n≥ Furthermore, we demonstrating that the lower bound found in [1], [2], and [3] are quite precise for the results obtained here for domination and independent domination, total and paired domination, and 2-domination respectively.