@article {IOPORT.06113008,
    author       = {Hu, Futao and Xu, Jun-Ming},
    title        = {Bondage number of mesh networks.},
    year         = {2012},
    journal      = {Frontiers of Mathematics in China},
    volume       = {7},
    number       = {5},
    issn         = {1673-3452},
    pages        = {813-826},
    publisher    = {Higher Education Press, Beijing; Springer, Heidelberg},
    doi          = {10.1007/s11464-012-0173-x},
    abstract     = {Summary: 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 $P_n \times P_m$ the Cartesian product of two paths $P_n$ and $P_m$. This paper determines the exact values of $b(P_n \times P_2), b(P_n \times P_3)$, and $b(P_n \times P_4)$ for $n \geqslant 2$.},
    identifier   = {06113008},
}