THE BONDAGE NUMBER OF C3×Cn

The domination number γ(G) of a graph G = (V, E) is the minimum cardinality of a subset of V such that every vertex is either in the set or is adjacent to some vertex in the set. The bondage number of b(G) of a graph G is the cardinality of a smallest set of edges whose removal from G results in a graph with domination number greater than γ(G). In this paper, we calculate the bondage number of the Cartesian product of cycles C3 and Cn for all n.