International Journal of Combinatorics

Volume 2013 (2013), Article ID 595210, 34 pages

http://dx.doi.org/10.1155/2013/595210

Review Article

## On Bondage Numbers of Graphs: A Survey with Some Comments

School of Mathematical Sciences, University of Science and Technology of China, Wentsun Wu Key Laboratory of CAS, Hefei, Anhui 230026, China

Received 15 December 2012; Revised 20 February 2013; Accepted 11 March 2013

Academic Editor: Chính T. Hoang

Copyright © 2013 Jun-Ming Xu. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

#### Linked References

- J.-M. Xu,
*Theory and Application of Graphs*, vol. 10 of*Network Theory and Applications*, Kluwer Academic, Dordrecht, The Netherlands, 2003. View at MathSciNet - S. T. Hedetniemi and R. C. Laskar, “Bibliography on domination in graphs and some basic definitions of domination parameters,”
*Discrete Mathematics*, vol. 86, no. 1–3, pp. 257–277, 1990. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - T. W. Haynes, S. T. Hedetniemi, and P. J. Slater,
*Fundamentals of Domination in Graphs*, vol. 208 of*Monographs and Textbooks in Pure and Applied Mathematics*, Marcel Dekker, New York, NY, USA, 1998. View at MathSciNet - T. W. Haynes, S. T. Hedetniemi, and P. J. Slater, Eds.,
*Domination in Graphs*, vol. 209 of*Monographs and Textbooks in Pure and Applied Mathematics*, Marcel Dekker, New York, NY, USA, 1998. View at MathSciNet - M. R. Garey and D. S. Johnson,
*Computers and Intractability*, W. H. Freeman and Company, San Francisco, Calif, USA, 1979. View at MathSciNet - H. B. Walikar and B. D. Acharya, “Domination critical graphs,”
*National Academy Science Letters*, vol. 2, pp. 70–72, 1979. View at Google Scholar - D. Bauer, F. Harary, J. Nieminen, and C. L. Suffel, “Domination alteration sets in graphs,”
*Discrete Mathematics*, vol. 47, no. 2-3, pp. 153–161, 1983. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - J. F. Fink, M. S. Jacobson, L. F. Kinch, and J. Roberts, “The bondage number of a graph,”
*Discrete Mathematics*, vol. 86, no. 1–3, pp. 47–57, 1990. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - F.-T. Hu and J.-M. Xu, “The bondage number of ($n-3$)-regular graph
*G*of order*n*,”*Ars Combinatoria*. to appear. - U. Teschner, “New results about the bondage number of a graph,”
*Discrete Mathematics*, vol. 171, no. 1–3, pp. 249–259, 1997. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - B. L. Hartnell and D. F. Rall, “A bound on the size of a graph with given order and bondage number,”
*Discrete Mathematics*, vol. 197-198, pp. 409–413, 1999, 16th British Combinatorial Conference (London, 1997). View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - B. L. Hartnell and D. F. Rall, “A characterization of trees in which no edge is essential to the domination number,”
*Ars Combinatoria*, vol. 33, pp. 65–76, 1992. View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - J. Topp and P. D. Vestergaard, “${\alpha}_{k}$- and ${\gamma}_{k}$-stable graphs,”
*Discrete Mathematics*, vol. 212, no. 1-2, pp. 149–160, 2000. View at Publisher · View at Google Scholar · View at MathSciNet - A. Meir and J. W. Moon, “Relations between packing and covering numbers of a tree,”
*Pacific Journal of Mathematics*, vol. 61, no. 1, pp. 225–233, 1975. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - B. L. Hartnell, L. K. Jørgensen, P. D. Vestergaard, and C. A. Whitehead, “Edge stability of the
*k*-domination number of trees,”*Bulletin of the Institute of Combinatorics and Its Applications*, vol. 22, pp. 31–40, 1998. View at Google Scholar · View at MathSciNet - F.-T. Hu and J.-M. Xu, “On the complexity of the bondage and reinforcement problems,”
*Journal of Complexity*, vol. 28, no. 2, pp. 192–201, 2012. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - B. L. Hartnell and D. F. Rall, “Bounds on the bondage number of a graph,”
*Discrete Mathematics*, vol. 128, no. 1–3, pp. 173–177, 1994. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - Y.-L. Wang, “On the bondage number of a graph,”
*Discrete Mathematics*, vol. 159, no. 1–3, pp. 291–294, 1996. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - G. H. Fricke, T. W. Haynes, S. M. Hedetniemi, S. T. Hedetniemi, and R. C. Laskar, “Excellent trees,”
*Bulletin of the Institute of Combinatorics and Its Applications*, vol. 34, pp. 27–38, 2002. View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - V. Samodivkin, “The bondage number of graphs: good and bad vertices,”
*Discussiones Mathematicae. Graph Theory*, vol. 28, no. 3, pp. 453–462, 2008. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - J. E. Dunbar, T. W. Haynes, U. Teschner, and L. Volkmann, “Bondage, insensitivity, and reinforcement,” in
*Domination in Graphs*, vol. 209 of*Monographs and Textbooks in Pure and Applied Mathematics*, pp. 471–489, Dekker, New York, NY, USA, 1998. View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - H. Liu and L. Sun, “The bondage and connectivity of a graph,”
*Discrete Mathematics*, vol. 263, no. 1–3, pp. 289–293, 2003. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - A.-H. Esfahanian and S. L. Hakimi, “On computing a conditional edge-connectivity of a graph,”
*Information Processing Letters*, vol. 27, no. 4, pp. 195–199, 1988. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - R. C. Brigham, P. Z. Chinn, and R. D. Dutton, “Vertex domination-critical graphs,”
*Networks*, vol. 18, no. 3, pp. 173–179, 1988. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - V. Samodivkin, “Domination with respect to nondegenerate properties: bondage number,”
*The Australasian Journal of Combinatorics*, vol. 45, pp. 217–226, 2009. View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - U. Teschner, “A new upper bound for the bondage number of graphs with small domination number,”
*The Australasian Journal of Combinatorics*, vol. 12, pp. 27–35, 1995. View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - J. Fulman, D. Hanson, and G. MacGillivray, “Vertex domination-critical graphs,”
*Networks*, vol. 25, no. 2, pp. 41–43, 1995. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - U. Teschner, “A counterexample to a conjecture on the bondage number of a graph,”
*Discrete Mathematics*, vol. 122, no. 1–3, pp. 393–395, 1993. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - U. Teschner, “The bondage number of a graph
*G*can be much greater than $\mathrm{\Delta}$(*G*),”*Ars Combinatoria*, vol. 43, pp. 81–87, 1996. View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - L. Volkmann, “On graphs with equal domination and covering numbers,”
*Discrete Applied Mathematics*, vol. 51, no. 1-2, pp. 211–217, 1994. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - L. A. Sanchis, “Maximum number of edges in connected graphs with a given domination number,”
*Discrete Mathematics*, vol. 87, no. 1, pp. 65–72, 1991. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - S. Klavžar and N. Seifter, “Dominating Cartesian products of cycles,”
*Discrete Applied Mathematics*, vol. 59, no. 2, pp. 129–136, 1995. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - H. K. Kim, “A note on Vizing’s conjecture about the bondage number,”
*Korean Journal of Mathematics*, vol. 10, no. 2, pp. 39–42, 2003. View at Google Scholar - M. Y. Sohn, X. Yuan, and H. S. Jeong, “The bondage number of ${C}_{3}\times {C}_{n}$,”
*Journal of the Korean Mathematical Society*, vol. 44, no. 6, pp. 1213–1231, 2007. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - L. Kang, M. Y. Sohn, and H. K. Kim, “Bondage number of the discrete torus ${C}_{n}\times {C}_{4}$,”
*Discrete Mathematics*, vol. 303, no. 1–3, pp. 80–86, 2005. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - J. Huang and J.-M. Xu, “The bondage numbers and efficient dominations of vertex-transitive graphs,”
*Discrete Mathematics*, vol. 308, no. 4, pp. 571–582, 2008. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - C. J. Xiang, X. Yuan, and M. Y. Sohn, “Domination and bondage number of ${C}_{3}\times {C}_{n}$,”
*Ars Combinatoria*, vol. 97, pp. 299–310, 2010. View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - M. S. Jacobson and L. F. Kinch, “On the domination number of products of graphs. I,”
*Ars Combinatoria*, vol. 18, pp. 33–44, 1984. View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - Y.-Q. Li, “A note on the bondage number of a graph,”
*Chinese Quarterly Journal of Mathematics*, vol. 9, no. 4, pp. 1–3, 1994. View at Google Scholar - F.-T. Hu and J.-M. Xu, “Bondage number of mesh networks,”
*Frontiers of Mathematics in China*, vol. 7, no. 5, pp. 813–826, 2012. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - R. Frucht and F. Harary, “On the corona of two graphs,”
*Aequationes Mathematicae*, vol. 4, pp. 322–325, 1970. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - K. Carlson and M. Develin, “On the bondage number of planar and directed graphs,”
*Discrete Mathematics*, vol. 306, no. 8-9, pp. 820–826, 2006. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - U. Teschner, “On the bondage number of block graphs,”
*Ars Combinatoria*, vol. 46, pp. 25–32, 1997. View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - J. Huang and J.-M. Xu, “Note on conjectures of bondage numbers of planar graphs,”
*Applied Mathematical Sciences*, vol. 6, no. 65–68, pp. 3277–3287, 2012. View at Google Scholar · View at MathSciNet - L. Kang and J. Yuan, “Bondage number of planar graphs,”
*Discrete Mathematics*, vol. 222, no. 1–3, pp. 191–198, 2000. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - M. Fischermann, D. Rautenbach, and L. Volkmann, “Remarks on the bondage number of planar graphs,”
*Discrete Mathematics*, vol. 260, no. 1–3, pp. 57–67, 2003. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - J. Hou, G. Liu, and J. Wu, “Bondage number of planar graphs without small cycles,”
*Utilitas Mathematica*, vol. 84, pp. 189–199, 2011. View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - J. Huang and J.-M. Xu, “The bondage numbers of graphs with small crossing numbers,”
*Discrete Mathematics*, vol. 307, no. 15, pp. 1881–1897, 2007. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - Q. Ma, S. Zhang, and J. Wang, “Bondage number of 1-planar graph,”
*Applied Mathematics*, vol. 1, no. 2, pp. 101–103, 2010. View at Google Scholar - J. Hou and G. Liu, “A bound on the bondage number of toroidal graphs,”
*Discrete Mathematics, Algorithms and Applications*, vol. 4, no. 3, Article ID 1250046, 5 pages, 2012. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - Y.-C. Cao, J.-M. Xu, and X.-R. Xu, “On bondage number of toroidal graphs,”
*Journal of University of Science and Technology of China*, vol. 39, no. 3, pp. 225–228, 2009. View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - Y.-C. Cao, J. Huang, and J.-M. Xu, “The bondage number of graphs with crossing number less than four,”
*Ars Combinatoria*. to appear. - H. K. Kim, “On the bondage numbers of some graphs,”
*Korean Journal of Mathematics*, vol. 11, no. 2, pp. 11–15, 2004. View at Google Scholar - A. Gagarin and V. Zverovich, “Upper bounds for the bondage number of graphs on topological surfaces,”
*Discrete Mathematics*, 2012. View at Publisher · View at Google Scholar - J. Huang, “An improved upper bound for the bondage number of graphs on surfaces,”
*Discrete Mathematics*, vol. 312, no. 18, pp. 2776–2781, 2012. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - A. Gagarin and V. Zverovich, “The bondage number of graphs on topological surfaces and Teschner's conjecture,”
*Discrete Mathematics*, vol. 313, no. 6, pp. 796–808, 2013. View at Publisher · View at Google Scholar · View at MathSciNet - V. Samodivkin, “Note on the bondage number of graphs on topological surfaces,” http://arxiv.org/abs/1208.6203.
- E. J. Cockayne, R. M. Dawes, and S. T. Hedetniemi, “Total domination in graphs,”
*Networks*, vol. 10, no. 3, pp. 211–219, 1980. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - R. Laskar, J. Pfaff, S. M. Hedetniemi, and S. T. Hedetniemi, “On the algorithmic complexity of total domination,”
*Society for Industrial and Applied Mathematics*, vol. 5, no. 3, pp. 420–425, 1984. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - J. Pfaff, R. C. Laskar, and S. T. Hedetniemi, “NP-completeness of total and connected domination and irredundance for bipartite graphs,” Tech. Rep. 428, Department of Mathematical Sciences, Clemson University, 1983. View at Google Scholar
- M. A. Henning, “A survey of selected recent results on total domination in graphs,”
*Discrete Mathematics*, vol. 309, no. 1, pp. 32–63, 2009. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - V. R. Kulli and D. K. Patwari, “The total bondage number of a graph,” in
*Advances in Graph Theory*, pp. 227–235, Vishwa, Gulbarga, India, 1991. View at Google Scholar · View at MathSciNet - F.-T. Hu, Y. Lu, and J.-M. Xu, “The total bondage number of grid graphs,”
*Discrete Applied Mathematics*, vol. 160, no. 16-17, pp. 2408–2418, 2012. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - J. Cao, M. Shi, and B. Wu, “Research on the total bondage number of a spectial network,” in
*Proceedings of the 3rd International Joint Conference on Computational Sciences and Optimization (CSO '10)*, pp. 456–458, May 2010. View at Publisher · View at Google Scholar · View at Scopus - N. Sridharan, MD. Elias, and V. S. A. Subramanian, “Total bondage number of a graph,”
*AKCE International Journal of Graphs and Combinatorics*, vol. 4, no. 2, pp. 203–209, 2007. View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - N. Jafari Rad and J. Raczek, “Some progress on total bondage in graphs,”
*Graphs and Combinatorics*, 2011. View at Publisher · View at Google Scholar - T. W. Haynes and P. J. Slater, “Paired-domination and the paired-domatic number,”
*Congressus Numerantium*, vol. 109, pp. 65–72, 1995. View at Google Scholar - T. W. Haynes and P. J. Slater, “Paired-domination in graphs,”
*Networks*, vol. 32, no. 3, pp. 199–206, 1998. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - X. Hou, “A characterization of $2\gamma ,{\gamma}_{P}$-trees,”
*Discrete Mathematics*, vol. 308, no. 15, pp. 3420–3426, 2008. View at Publisher · View at Google Scholar · View at MathSciNet - K. E. Proffitt, T. W. Haynes, and P. J. Slater, “Paired-domination in grid graphs,”
*Congressus Numerantium*, vol. 150, pp. 161–172, 2001. View at Google Scholar - H. Qiao, L. Kang, M. Cardei, and D.-Z. Du, “Paired-domination of trees,”
*Journal of Global Optimization*, vol. 25, no. 1, pp. 43–54, 2003. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - E. Shan, L. Kang, and M. A. Henning, “A characterization of trees with equal total domination and paired-domination numbers,”
*The Australasian Journal of Combinatorics*, vol. 30, pp. 31–39, 2004. View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - J. Raczek, “Paired bondage in trees,”
*Discrete Mathematics*, vol. 308, no. 23, pp. 5570–5575, 2008. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - J. A. Telle and A. Proskurowski, “Algorithms for vertex partitioning problems on partial
*k*-trees,”*SIAM Journal on Discrete Mathematics*, vol. 10, no. 4, pp. 529–550, 1997. View at Publisher · View at Google Scholar · View at MathSciNet - G. S. Domke, J. H. Hattingh, M. A. Henning, and L. R. Markus, “Restrained domination in trees,”
*Discrete Mathematics*, vol. 211, no. 1–3, pp. 1–9, 2000. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - G. S. Domke, J. H. Hattingh, M. A. Henning, and L. R. Markus, “Restrained domination in graphs with minimum degree two,”
*Journal of Combinatorial Mathematics and Combinatorial Computing*, vol. 35, pp. 239–254, 2000. View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - G. S. Domke, J. H. Hattingh, S. T. Hedetniemi, R. C. Laskar, and L. R. Markus, “Restrained domination in graphs,”
*Discrete Mathematics*, vol. 203, no. 1–3, pp. 61–69, 1999. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - J. H. Hattingh and E. J. Joubert, “An upper bound for the restrained domination number of a graph with minimum degree at least two in terms of order and minimum degree,”
*Discrete Applied Mathematics*, vol. 157, no. 13, pp. 2846–2858, 2009. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - M. A. Henning, “Graphs with large restrained domination number,”
*Discrete Mathematics*, vol. 197-198, pp. 415–429, 1999, 16th British Combinatorial Conference (London, 1997). View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - J. H. Hattingh and A. R. Plummer, “Restrained bondage in graphs,”
*Discrete Mathematics*, vol. 308, no. 23, pp. 5446–5453, 2008. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - N. Jafari Rad, R. Hasni, J. Raczek, and L. Volkmann, “Total restrained bondage in graphs,”
*Acta Mathematica Sinica*, vol. 29, no. 6, pp. 1033–1042, 2013. View at Publisher · View at Google Scholar - J. Cyman and J. Raczek, “On the total restrained domination number of a graph,”
*The Australasian Journal of Combinatorics*, vol. 36, pp. 91–100, 2006. View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - M. A. Henning, “Graphs with large total domination number,”
*Journal of Graph Theory*, vol. 35, no. 1, pp. 21–45, 2000. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - D.-X. Ma, X.-G. Chen, and L. Sun, “On total restrained domination in graphs,”
*Czechoslovak Mathematical Journal*, vol. 55, no. 1, pp. 165–173, 2005. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - B. Zelinka, “Remarks on restrained domination and total restrained domination in graphs,”
*Czechoslovak Mathematical Journal*, vol. 55, no. 2, pp. 393–396, 2005. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - W. Goddard and M. A. Henning, “Independent domination in graphs: a survey and recent results,”
*Discrete Mathematics*, vol. 313, no. 7, pp. 839–854, 2013. View at Publisher · View at Google Scholar · View at MathSciNet - J. H. Zhang, H. L. Liu, and L. Sun, “Independence bondage number and reinforcement number of some graphs,”
*Transactions of Beijing Institute of Technology*, vol. 23, no. 2, pp. 140–142, 2003. View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - K. D. Dharmalingam,
*Studies in Graph Theory—equitable domination and bottleneck domination [Ph.D. thesis]*, Madurai Kamaraj University, Madurai, India, 2006. - G. Deepak, N. D. Soner, and A. Alwardi, “The equitable bondage number of a graph,”
*Research Journal of Pure Algebra*, vol. 1, no. 9, pp. 209–212, 2011. View at Google Scholar - E. Sampathkumar and H. B. Walikar, “The connected domination number of a graph,”
*Journal of Mathematical and Physical Sciences*, vol. 13, no. 6, pp. 607–613, 1979. View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - K. White, M. Farber, and W. Pulleyblank, “Steiner trees, connected domination and strongly chordal graphs,”
*Networks*, vol. 15, no. 1, pp. 109–124, 1985. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - M. Cadei, M. X. Cheng, X. Cheng, and D.-Z. Du, “Connected domination in Ad Hoc wireless networks,” in
*Proceedings of the 6th International Conference on Computer Science and Informatics (CS&I '02)*, 2002. - J. F. Fink and M. S. Jacobson, “n-domination in graphs,” in
*Graph Theory with Applications to Algorithms and Computer Science*, Wiley-Interscience Publications, pp. 283–300, Wiley, New York, NY, USA, 1985. View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - M. Chellali, O. Favaron, A. Hansberg, and L. Volkmann, “k-domination and k-independence in graphs: a survey,”
*Graphs and Combinatorics*, vol. 28, no. 1, pp. 1–55, 2012. View at Publisher · View at Google Scholar · View at MathSciNet - Y. Lu, X. Hou, J.-M. Xu, and N. Li, “Trees with unique minimum
*p*-dominating sets,”*Utilitas Mathematica*, vol. 86, pp. 193–205, 2011. View at Google Scholar · View at MathSciNet - Y. Lu and J.-M. Xu, “The
*p*-bondage number of trees,”*Graphs and Combinatorics*, vol. 27, no. 1, pp. 129–141, 2011. View at Publisher · View at Google Scholar · View at MathSciNet - Y. Lu and J.-M. Xu, “The 2-domination and 2-bondage numbers of grid graphs. A manuscript,” http://arxiv.org/abs/1204.4514.
- M. Krzywkowski, “Non-isolating 2-bondage in graphs,”
*The Journal of the Mathematical Society of Japan*, vol. 64, no. 4, 2012. View at Google Scholar - M. A. Henning, O. R. Oellermann, and H. C. Swart, “Bounds on distance domination parameters,”
*Journal of Combinatorics, Information & System Sciences*, vol. 16, no. 1, pp. 11–18, 1991. View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - F. Tian and J.-M. Xu, “Bounds for distance domination numbers of graphs,”
*Journal of University of Science and Technology of China*, vol. 34, no. 5, pp. 529–534, 2004. View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - F. Tian and J.-M. Xu, “Distance domination-critical graphs,”
*Applied Mathematics Letters*, vol. 21, no. 4, pp. 416–420, 2008. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - F. Tian and J.-M. Xu, “A note on distance domination numbers of graphs,”
*The Australasian Journal of Combinatorics*, vol. 43, pp. 181–190, 2009. View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - F. Tian and J.-M. Xu, “Average distances and distance domination numbers,”
*Discrete Applied Mathematics*, vol. 157, no. 5, pp. 1113–1127, 2009. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - Z.-L. Liu, F. Tian, and J.-M. Xu, “Probabilistic analysis of upper bounds for 2-connected distance
*k*-dominating sets in graphs,”*Theoretical Computer Science*, vol. 410, no. 38–40, pp. 3804–3813, 2009. View at Publisher · View at Google Scholar · View at MathSciNet - M. A. Henning, O. R. Oellermann, and H. C. Swart, “Distance domination critical graphs,”
*Journal of Combinatorial Mathematics and Combinatorial Computing*, vol. 44, pp. 33–45, 2003. View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - T. J. Bean, M. A. Henning, and H. C. Swart, “On the integrity of distance domination in graphs,”
*The Australasian Journal of Combinatorics*, vol. 10, pp. 29–43, 1994. View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - M. Fischermann and L. Volkmann, “A remark on a conjecture for the (
*k,p*)-domination number,”*Utilitas Mathematica*, vol. 67, pp. 223–227, 2005. View at Google Scholar · View at MathSciNet - T. Korneffel, D. Meierling, and L. Volkmann, “A remark on the (2,2)-domination number,”
*Discussiones Mathematicae. Graph Theory*, vol. 28, no. 2, pp. 361–366, 2008. View at Publisher · View at Google Scholar · View at MathSciNet - Y. Lu, X. Hou, and J.-M. Xu, “On the (2,2)-domination number of trees,”
*Discussiones Mathematicae. Graph Theory*, vol. 30, no. 2, pp. 185–199, 2010. View at Publisher · View at Google Scholar · View at MathSciNet - H. Li and J.-M. Xu, “(
*d,m*)-domination numbers of m-connected graphs,”*Rapports de Recherche*1130, LRI, Université Paris-Sud, 1997. View at Google Scholar - S. M. Hedetniemi, S. T. Hedetniemi, and T. V. Wimer, “Linear time resource allocation algorithms for trees,” Tech. Rep. URI-014, Department of Mathematical Sciences, Clemson University, 1987. View at Google Scholar
- M. Farber, “Domination, independent domination, and duality in strongly chordal graphs,”
*Discrete Applied Mathematics*, vol. 7, no. 2, pp. 115–130, 1984. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - G. S. Domke and R. C. Laskar, “The bondage and reinforcement numbers of ${\gamma}_{f}$ for some graphs,”
*Discrete Mathematics*, vol. 167-168, pp. 249–259, 1997. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - G. S. Domke, S. T. Hedetniemi, and R. C. Laskar, “Fractional packings, coverings, and irredundance in graphs,” vol. 66, pp. 227–238, 1988. View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
- E. J. Cockayne, P. A. Dreyer, Jr., S. M. Hedetniemi, and S. T. Hedetniemi, “Roman domination in graphs,”
*Discrete Mathematics*, vol. 278, no. 1–3, pp. 11–22, 2004. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - I. Stewart, “Defend the roman empire,”
*Scientific American*, vol. 281, pp. 136–139, 1999. View at Google Scholar - C. S. ReVelle and K. E. Rosing, “Defendens imperium romanum: a classical problem in military strategy,”
*The American Mathematical Monthly*, vol. 107, no. 7, pp. 585–594, 2000. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - A. Bahremandpour, F.-T. Hu, S. M. Sheikholeslami, and J.-M. Xu, “On the Roman bondage number of a graph,”
*Discrete Mathematics, Algorithms and Applications*, vol. 5, no. 1, Article ID 1350001, 15 pages, 2013. View at Publisher · View at Google Scholar - N. Jafari Rad and L. Volkmann, “Roman bondage in graphs,”
*Discussiones Mathematicae. Graph Theory*, vol. 31, no. 4, pp. 763–773, 2011. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - K. Ebadi and L. PushpaLatha, “Roman bondage and Roman reinforcement numbers of a graph,”
*International Journal of Contemporary Mathematical Sciences*, vol. 5, pp. 1487–1497, 2010. View at Google Scholar - N. Dehgardi, S. M. Sheikholeslami, and L. Volkman, “On the Roman
*k*-bondage number of a graph,”*AKCE International Journal of Graphs and Combinatorics*, vol. 8, pp. 169–180, 2011. View at Google Scholar - S. Akbari and S. Qajar, “A note on Roman bondage number of graphs,”
*Ars Combinatoria*. to Appear. - F.-T. Hu and J.-M. Xu, “Roman bondage numbers of some graphs,” http://arxiv.org/abs/1109.3933.
- N. Jafari Rad and L. Volkmann, “On the Roman bondage number of planar graphs,”
*Graphs and Combinatorics*, vol. 27, no. 4, pp. 531–538, 2011. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - S. Akbari, M. Khatirinejad, and S. Qajar, “A note on the roman bondage number of planar graphs,”
*Graphs and Combinatorics*, 2012. View at Publisher · View at Google Scholar - B. Brešar, M. A. Henning, and D. F. Rall, “Rainbow domination in graphs,”
*Taiwanese Journal of Mathematics*, vol. 12, no. 1, pp. 213–225, 2008. View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - B. L. Hartnell and D. F. Rall, “On dominating the Cartesian product of a graph and
*α*k,”*Discussiones Mathematicae. Graph Theory*, vol. 24, no. 3, pp. 389–402, 2004. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - N. Dehgardi, S. M. Sheikholeslami, and L. Volkman, “The
*k*-rainbow bondage number of a graph,” to appear in Discrete Applied Mathematics. - J. von Neumann and O. Morgenstern,
*Theory of Games and Economic Behavior*, Princeton University Press, Princeton, NJ, USA, 1944. View at MathSciNet - C. Berge,
*Theoríe des Graphes et ses Applications*, 1958. - O. Ore,
*Theory of Graphs*, vol. 38, American Mathematical Society Colloquium Publications, 1962. - E. Shan and L. Kang, “Bondage number in oriented graphs,”
*Ars Combinatoria*, vol. 84, pp. 319–331, 2007. View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - J. Huang and J.-M. Xu, “The bondage numbers of extended de Bruijn and Kautz digraphs,”
*Computers & Mathematics with Applications*, vol. 51, no. 6-7, pp. 1137–1147, 2006. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - J. Huang and J.-M. Xu, “The total domination and total bondage numbers of extended de Bruijn and Kautz digraphs,”
*Computers & Mathematics with Applications*, vol. 53, no. 8, pp. 1206–1213, 2007. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - Y. Shibata and Y. Gonda, “Extension of de Bruijn graph and Kautz graph,”
*Computers & Mathematics with Applications*, vol. 30, no. 9, pp. 51–61, 1995. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - X. Zhang, J. Liu, and J. Meng, “The bondage number in complete
*t*-partite digraphs,”*Information Processing Letters*, vol. 109, no. 17, pp. 997–1000, 2009. View at Publisher · View at Google Scholar · View at MathSciNet - D. W. Bange, A. E. Barkauskas, and P. J. Slater, “Efficient dominating sets in graphs,” in
*Applications of Discrete Mathematics*, pp. 189–199, SIAM, Philadelphia, Pa, USA, 1988. View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - M. Livingston and Q. F. Stout, “Perfect dominating sets,”
*Congressus Numerantium*, vol. 79, pp. 187–203, 1990. View at Google Scholar - L. Clark, “Perfect domination in random graphs,”
*Journal of Combinatorial Mathematics and Combinatorial Computing*, vol. 14, pp. 173–182, 1993. View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - D. W. Bange, A. E. Barkauskas, L. H. Host, and L. H. Clark, “Efficient domination of the orientations of a graph,”
*Discrete Mathematics*, vol. 178, no. 1–3, pp. 1–14, 1998. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - A. E. Barkauskas and L. H. Host, “Finding efficient dominating sets in oriented graphs,”
*Congressus Numerantium*, vol. 98, pp. 27–32, 1993. View at Google Scholar - I. J. Dejter and O. Serra, “Efficient dominating sets in Cayley graphs,”
*Discrete Applied Mathematics*, vol. 129, no. 2-3, pp. 319–328, 2003. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - J. Lee, “Independent perfect domination sets in Cayley graphs,”
*Journal of Graph Theory*, vol. 37, no. 4, pp. 213–219, 2001. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - W. Gu, X. Jia, and J. Shen, “Independent perfect domination sets in meshes, tori and trees,” Unpublished.
- N. Obradović, J. Peters, and G. Ružić, “Efficient domination in circulant graphs with two chord lengths,”
*Information Processing Letters*, vol. 102, no. 6, pp. 253–258, 2007. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - K. Reji Kumar and G. MacGillivray, “Efficient domination in circulant graphs,”
*Discrete Mathematics*, vol. 313, no. 6, pp. 767–771, 2013. View at Publisher · View at Google Scholar · View at MathSciNet - D. Van Wieren, M. Livingston, and Q. F. Stout, “Perfect dominating sets on cube-connected cycles,”
*Congressus Numerantium*, vol. 97, pp. 51–70, 1993. View at Google Scholar