Domination and Bondage number of C5 x Cn

Let G be finite, simple graph, we denote by gamma(G) the domination number of G. The bondage number of G, denoted by b(G), is the minimum number of the edges of G whose removal increase the domination number of G. C-n denote the cycle of n vertices. For n >= 5 and n not equal 5k +3, the domination number of C-5 x C-n was determined in [6]. In this paper, we calculate the domination number of C-5 x C-n for n = 5k + 3(k >= 1), and also study the bondage number of this graph, where C-5 x C-n is the cartesian product of C-5 and C-n.