\input zb-basic
\input zb-ioport
\iteman{io-port 06113008}
\itemau{Hu, Futao; Xu, Jun-Ming}
\itemti{Bondage number of mesh networks.}
\itemso{Front. Math. China 7, No. 5, 813-826 (2012).}
\itemab
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$.
\itemrv{~}
\itemcc{}
\itemut{bondage number; dominating set; domination number; mesh network}
\itemli{doi:10.1007/s11464-012-0173-x}
\end