Bondage number of grid graphs

Abstract

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.

13 pages. Discrete Applied Mathematics, 2014

References in corpus (2)

• Roman domination in Cartesian product graphs and strong product graphs
• The Bondage Number of Mesh Networks

Cited by in corpus (1)

• The Bondage Number of the Strong Product of a Complete Graph and a Path