Bondage number of grid graphs

作者：Dettlaff Magda; Lemanska Magdalena; Yero Ismael G^*

来源：Discrete Applied Mathematics, 2014, 167: 94-99.

DOI：10.1016/j.dam.2013.11.020

• Domination
• Bondage number
• Strong product graphs
• Direct product graphs

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.

• 出版日期2014-4-20