Upper bounds on the bondage number of the strong product of a graph and a tree

References

• D. Bauer, F. Harary, J. Nieminen, and C.L. Suffel, Domination alteration sets in graphs, Discrete Math. 47 (1983), pp. 153–161. doi: 10.1016/0012-365X(83)90085-7
   Web of Science ®Google Scholar
• J.X. Cao, X.D Yuan, and M.Y. Sohn, Domination and bondage number of C5×Cn, Ars Combin. 97A (2010), pp. 299–310.
   Web of Science ®Google Scholar
• M. Dettlaff, M. Lemaska, and I.G. Yero, Bondage number of grid graphs, Discrete Appl. Math. 167 (2014), pp. 94–99. doi: 10.1016/j.dam.2013.11.020
   Web of Science ®Google Scholar
• J.E. Dunbar, T.W. Haynes, U. Teschner, and L. Volkmann, Bondage, insensitivity, and reinforcement, in Domination in Graphs Advanced Topics, T.W. Haynes, S.T. Hedetniemi, and P.L. Slater, eds., Marcel Dekker, New York, 1998, pp. 471–489.
   Google Scholar
• J.F. Fink, M.S. Jacobson, L.F. Kinch, and J. Roberts, The bondage number of a graph, Discrete Math. 86 (1990), pp. 47–57. doi: 10.1016/0012-365X(90)90348-L
   Web of Science ®Google Scholar
• M. Fischermann, D. Rautenbach, and L. Volkmann, Remarks on the bondage number of planar graphs, Discrete Math. 260 (2003), pp. 57–67. doi: 10.1016/S0012-365X(02)00449-1
   Web of Science ®Google Scholar
• A. Gagarin and V. Zverovich, Upper bounds for the bondage number of graphs on topological surfaces, Discrete Math. 313(11) (2013), pp. 1132–1137. doi: 10.1016/j.disc.2011.10.018
   Web of Science ®Google Scholar
• M.R. Garey and D.S. Johnson, Computers and Intractability, W.H. Freeman and Company, San Francisco, CA, 1979.
   Google Scholar
• R. Hammack, W. Imrich, and S. Klavžar, Handbook of Product Graphs, CRC Press, New York–London, 2011.
   Google Scholar
• B.L. Hartnell, L.K. Jorgensen, P.D. Vestergaard, and C. Whitehead, Edge stability of the k-domination number of trees, Bull. Inst. Combin. Appl. 22 (1998), pp. 31–40.
   Google Scholar
• 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), pp. 65–76.
   Web of Science ®Google Scholar
• B.L. Hartnell and D.F. Rall, Bounds on the bondage number of a graph, Discrete Math. 128 (1994), pp. 173–177. doi: 10.1016/0012-365X(94)90111-2
   Web of Science ®Google Scholar
• B.L. Hartnell and D.F. Rall, A bound on the size of a graph with given order and bondage number, Discrete Math. 197–198 (1999), pp. 409–413. doi: 10.1016/S0012-365X(99)90093-6
   Web of Science ®Google Scholar
• T.W. Haynes, S.T. Hedetniemi, and P.J. Slater, Domination in Graphs Advanced Topics, Marcel Dekker, New York, 1998.
   Google Scholar
• T.W. Haynes, S.T. Hedetniemi, and P.J. Slater, Fundamentals of Domination in Graphs, Marcel Dekker, New York, 1998.
   Google Scholar
• F.T. Hu and J.M. Xu, On the complexity of the bondage and reinforcement problems, J. Complexity 28 (2012), pp. 192–201. doi: 10.1016/j.jco.2011.11.001
   Web of Science ®Google Scholar
• F.T. Hu and J.M. Xu, The bondage number of mesh network, Front. Math. China 7(5) (2012), pp. 813–826. doi: 10.1007/s11464-012-0173-x
   Web of Science ®Google Scholar
• J. Huang and J.M. Xu, The bondage numbers and efficient dominations of vertex-transitive graphs, Discrete Math. 308(4) (2008), pp. 571–582. doi: 10.1016/j.disc.2007.03.027
   Web of Science ®Google Scholar
• M.S. Jacobson and L.F. Kinch, On the domination number of products of graphs: 1, Ars Combin. 18 (1983), pp. 33–44.
   Google Scholar
• L.Y. Kang, M.Y. Sohn, and H.K. Kim, Bondage number of the discrete torus Cn×C4, Discrete Math. 303 (2005), pp. 80–86. doi: 10.1016/j.disc.2004.12.019
   Web of Science ®Google Scholar
• A. Meir and J.W. Moon, Relations between packing and covering numbers of a tree, Pacific J. Math. 61 (1975), pp. 225–233. doi: 10.2140/pjm.1975.61.225
   Web of Science ®Google Scholar
• R.J. Nowakowski and D.F. Rall, Associative graph products and their independence, domination and coloring numbers, Discuss. Math. Graph Theory 16 (1996), pp. 53–79. doi: 10.7151/dmgt.1023
   Google Scholar
• M.Y. Sohn, X.D. Yuan, and H.S. Jeong, The bondage number of C3×Cn, J. Korean Math. Soc. 44(6) (2007), pp. 1213–1231. doi: 10.4134/JKMS.2007.44.6.1213
   Web of Science ®Google Scholar
• U. Teschner, The bondage number of a graph G can be much greater than Δ(G), Ars Combin. 43 (1996), pp. 81–87.
   Web of Science ®Google Scholar
• U. Teschner, New results about the bondage number of a graph, Discrete Math. 171 (1997), pp. 249–259. doi: 10.1016/S0012-365X(96)00007-6
   Web of Science ®Google Scholar
• J. Topp and P.D. Vestergaard, αk and γk-stable graphs, Discrete Math. 212(1–2) (2000), pp. 149–160. doi: 10.1016/S0012-365X(99)00216-2
   Web of Science ®Google Scholar
• J.M. Xu, On bondage number of graphs: A survey with some comments, Int. J. Comb. 2013 (2013), Article ID 595210, 34 pages.
   Google Scholar
• W.S. Zhao and H.P. Zhang, Bondage number of the strong product of two paths, Front. Math. China. 10(2) (2015), pp. 435–460. doi: 10.1007/s11464-014-0391-5
   Web of Science ®Google Scholar
• W.S. Zhao and H.P. Zhang, The bondage number of the strong product of a complete graph with a path and a special starlike tree, Discrete Math. Algorithms Appl. 8(1) (2016), p. 1650006 (14 pages). doi: 10.1142/S1793830916500063
   Web of Science ®Google Scholar