The Bondage Number of Mesh Networks
Hu, Fu-Tao · Cao, Yong-Chang · Xu, Jun-Ming
Original · EN
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ₙ× Pₘ be the Cartesian product of two paths Pₙ and Pₘ. This paper determines that the exact value of b(Pₙ× P₂), b(Pₙ× P₃) and b(Pₙ× P₄) for n≥ 2.
English translation
This paper has no Arabic translation yet. Be the first: it takes a few seconds, and the result is stored for every future reader.