1 |
B. L. Hartnell and D. F. Rall, Bounds on the bondage number of a graph, Discrete Math. 128 (1994), no. 1-3, 173-177
DOI
ScienceOn
|
2 |
J. F. Fink, M. S. Jacobson, L. F. Kinch, and J. Roberts, The bondage number of a graph, Discrete Math. 86 (1990), no. 1-3, 47-57
DOI
ScienceOn
|
3 |
B. L. Hartnell and D. F. Rall, A characterization of trees in which no edge is essential to the domination number, Ars Combin. 33 (1992), 65-76
|
4 |
L. Y. Kang and J. J. Yuan, Bondage number of planar graphs, Discrete Math. 222 (2000), no. 1-3, 191-198
DOI
ScienceOn
|
5 |
L. Y. Kang, M. Y. Sohn, and H. K. Kim, Bondage number of the discrete torus , Discrete Math. 303 (2005), no. 1-3, 80-86
DOI
ScienceOn
|
6 |
S. Klav.zar and S. Sandi, Norbert Dominating Cartesian products of cycles, Discrete Appl. Math. 59 (1995), no. 2, 129-136
DOI
ScienceOn
|
7 |
T. Chang and E. Clark, The domination numbers of the grid graphs, J. Graph Theory 17 (1993), no. 1, 81-107
DOI
|
8 |
J. E. Dunbar, T. W. Haynes, U. Teschner, and L. Volkmann, `Bondage, Insensitivity, and Reinforcement' in Domination in graphs advanced topics (Marcel Decker, New York,1998), 471-489
|
9 |
M. El-Zahar and C. M. Pareek, Domination number of products of graphs, Ars Combin. 31 (1991), 223-227
|