The domination number ${gamma}(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 ${gamma}(G)$. In this paper, we calculate the bondage number of the Cartesian product of cycles $C_3;and;C_n$ for all n.