  The bondage number $b(G)$ of a nonempty graph $G$ is the cardinality of a
smallest set of edges whose removal from $G$ results in a graph with domination
number greater than the domination number of $G$. Here we study the bondage
number of some grid-like graphs. In this sense, we obtain some bounds or exact
values of the bondage number of some strong product and direct product of two
paths.
