The bondage number b(G) of a nonempty graph G is the smallest number of edges whose removal from G results in a graph with domination number greater than that of G. Denote Pn × Pm the Cartesian product of two paths Pn and Pm. This paper determines the exact values of b(Pn × P2), b(Pn × P3), and b(Pn × P4) for n 2.
