Bondage number of grid graphs
Combinatorics
2014-01-16 v2
Abstract
The bondage number of a nonempty graph is the cardinality of a smallest set of edges whose removal from results in a graph with domination number greater than the domination number of . 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.
Cite
@article{arxiv.1204.0533,
title = {Bondage number of grid graphs},
author = {Magda Dettlaff and Magdalena Lemanska and Ismael G. Yero},
journal= {arXiv preprint arXiv:1204.0533},
year = {2014}
}
Comments
13 pages. Discrete Applied Mathematics, 2014