Skip to main content
SpringerLink
Log in

Total Domination in Planar Graphs

  • Chapter
  • First Online:
Total Domination in Graphs

Part of the book series: Springer Monographs in Mathematics ((SMM))

  • 1877 Accesses

Abstract

In the metadata of the chapter that will be visualized online, please change the abstract to read as follows: “In this chapter, we look at total domination in planar graphs.”

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 79.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 99.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 99.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Adhar, G.S., Peng, S.: Parallel algorithms for finding connected, independent and total domination in interval graphs. Algorithms and Parallel VLSI Architectures, II (Château de Bonas, 1991), pp. 85–90. Elsevier, Amsterdam (1992)

    Google Scholar 

  2. Alber, J., Bodlaender, H.L., Fernau, F., Niedermeier, R.: Fixed parameter algorithms for planar dominating set and related problems. In: Algorithm theory of Scandinavian Workshop on Algorithm Theory 2000 (Bergen, 2000), pp. 97–110. Springer, Berlin (2000)

    Google Scholar 

  3. Alon, N.: Transversal number of uniform hypergraphs. Graphs Combin. 6, 1–4 (1990)

    Article  MathSciNet  MATH  Google Scholar 

  4. Alon, N., Bregman, Z.: Every 8-uniform 8-regular hypergraph is 2-colorable. Graphs Combin. 4, 303–306 (1988)

    Article  MathSciNet  MATH  Google Scholar 

  5. Alon, N., Gutner, S.: Linear time algorithms for finding a dominating set of fixed size in degenerated graphs. Algorithmica 54(4), 544–556 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  6. Aouchiche, M., Hansen, P.: A survey of Nordhaus-Gaddum type relations. Discrete Applied Math. 161, 466–546 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  7. Archdeacon, D., Ellis-Monaghan, J., Fischer, D., Froncek, D., Lam, P.C.B., Seager, S., Wei, B., Yuster, R.: Some remarks on domination. J. Graph Theory 46, 207–210 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  8. Arnborg, S., Lagergren, J., Seese, D.: Easy problems for tree-decomposable graphs. J. Algorithms 12, 308–340 (1991)

    Article  MathSciNet  MATH  Google Scholar 

  9. Bacsó, G.: Complete description of forbidden subgraphs in the structural domination problem. Discrete Math. 309, 2466–2472 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  10. Bertossi, A.A.: Total domination in interval graphs. Inform. Process. Lett. 23, 131–134 (1986)

    Article  MathSciNet  MATH  Google Scholar 

  11. Bertossi, A.A., Gori, A.: Total domination and irredundance in weighted interval graphs. SIAM J. Discrete Math. 1, 317–327 (1988)

    Article  MathSciNet  MATH  Google Scholar 

  12. Bertossi, A.A., Moretti, S.: Parallel algorithms on circular-arc graphs. Inform. Process. Lett. 33, 275–281 (1990)

    Article  MathSciNet  MATH  Google Scholar 

  13. Blidia, M., Chellali, M., Maffray, F., Moncel, J., Semri, A.: Locating-domination and identifying codes in trees. Australasian J. Combin. 39, 219–232 (2007)

    MathSciNet  MATH  Google Scholar 

  14. Blidia, M., Dali, W.: A characterization of locating-total domination edge critical graphs. Discussiones Math. Graph Theory 31(1), 197–202 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  15. Broere, I., Dorfling, M., Goddard, W., Hattingh, J.H., Henning, M.A., Ungerer, E.: Augmenting trees to have two disjoint total dominating sets. Bull. Inst. Combin. Appl. 42, 12–18 (2004)

    MathSciNet  MATH  Google Scholar 

  16. Bollobás, B., Cockayne, E.J.: Graph-theoretic parameters concerning domination, independence, and irredundance. J. Graph Theory 3, 241–249 (1979)

    Article  MathSciNet  MATH  Google Scholar 

  17. Brandstädt, A., Kratsch, D.: On domination problems on permutation and other graphs. Theoret. Comput. Sci. 54, 181–198 (1987)

    Article  MathSciNet  MATH  Google Scholar 

  18. Brandstädt, A., Le, V.B., Spinrad, J.P.: Graph Classes: A Survey (Monographs in Discrete Mathematics and Applications). SIAM, Philedelphia (1987)

    Google Scholar 

  19. Brešar, B., Dorbec, P., Goddard, W., Hartnell, B., Henning, M.A., Klavžar, S., Rall, D.: Vizing’s conjecture: A survey and recent results. J. Graph Theory 69, 46–76 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  20. Brigham, R.C., Carrington, J.R., Vitray, R.P.: Connected graphs with maximum total domination number. J. Combin. Comput. Combin. Math. 34, 81–96 (2000)

    MathSciNet  MATH  Google Scholar 

  21. Brigham, R.C., Chinn, P.Z., Dutton, R.D.: Vertex domination-critical graphs. Networks 18, 173–179 (1988)

    Article  MathSciNet  MATH  Google Scholar 

  22. Caccetta, L., Häggkvist, R.: On diameter critical graphs. Discrete Math. 28(3), 223–229 (1979)

    Article  MathSciNet  MATH  Google Scholar 

  23. Calkin, N., Dankelmann, P.: The domatic number of regular graphs. Ars Combinatoria 73, 247–255 (2004)

    MathSciNet  MATH  Google Scholar 

  24. Chang, G.J.: Labeling algorithms for domination problems in sun-free chordal graphs. Discrete Appl. Math. 22, 21–34 (1988)

    Article  MathSciNet  MATH  Google Scholar 

  25. Chang, M.S.: Efficient algorithms for the domination problems on interval and circular-arc graphs. SIAM J. Comput. 27, 1671–1694 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  26. Chang, M.S., Wu, S.C., Chang, G.J., Yeh, H.G.: Domination in distance-hereditary graphs. Discrete Appl. Math. 116, 103–113 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  27. Chellali, M.: On locating and differentiating-total domination in trees. Discus. Math. Graph Theory 28(3), 383–392 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  28. Chellali, M., Favaron, O., Haynes, T.W., Raber, D.: Ratios of some domination parameters in trees. Discrete Math. 308, 3879–3887 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  29. Chellali, M., Haynes, T.W.: Total and paired-domination numbers of a tree. AKCE Int. J. Graph Comb. 1, 69–75 (2004)

    MathSciNet  MATH  Google Scholar 

  30. Chellali, M., Haynes, T.W.: A note on the total domination of a tree. J. Combin. Math. Combin. Comput. 58, 189–193 (2006)

    MathSciNet  MATH  Google Scholar 

  31. Chellali, M., Rad, N.: Locating-total domination critical graphs. Australasian J. Combin. 45, 227–234 (2009)

    MathSciNet  MATH  Google Scholar 

  32. Chen, X., Liu, J., Meng, J.: Total restrained domination in graphs. Comput. Math. Appl. 62, 2892–2898 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  33. Chen, X.G., Sohn, M.Y.: Bounds on the locating-total domination number of a tree. Discrete Appl. Math. 159, 769–773 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  34. Chlebík, M., Chlebíková, J.: Approximation hardness of dominating set problems in bounded degree graphs. Inform. Comput. 206, 1264–1275 (2008)

    Article  MATH  Google Scholar 

  35. Chvátal, V., McDiarmid, C.: Small transversals in hypergraphs. Combinatorica 12, 19–26 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  36. Clark, W.E., Suen, S.: An inequality related to Vizings conjecture. Electronic J. Combin. 7(Note 4), 3pp (2000)

    Google Scholar 

  37. Cockayne, E.J., Dawes, R.M., Hedetniemi, S.T.: Total domination in graphs. Networks 10, 211–219 (1980)

    Article  MathSciNet  MATH  Google Scholar 

  38. Corneil, D.G., Stewart, L.: Dominating sets in perfect graphs. Discrete Math. 86, 145–164 (1990)

    Article  MathSciNet  MATH  Google Scholar 

  39. Cockayne, E.J., Dawes, R.M., Hedetniemi, S.T.: Total domination in graphs. Networks 10, 211–219 (1980)

    Article  MathSciNet  MATH  Google Scholar 

  40. Cockayne, E., Henning, M.A., Mynhardt, C.M.: Vertices contained in all or in no minimum total dominating set of a tree. Discrete Math. 260, 37–44 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  41. Damaschke, F., Müller, H., Kratsch, D.: Domination in convex and chordal bipartite graphs. Inform. Process. Lett. 36, 231–236 (1990)

    Article  MathSciNet  MATH  Google Scholar 

  42. Dankelmann, P., Day, D., Hattingh, J.H., Henning, M.A., Markus, L.R., Swart, H.C.: On equality in an upper bound for the restrained and total domination numbers of a graph. Discrete Math. 307, 2845–2852 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  43. Dankelmann, P., Domke, G.S., Goddard, W., Grobler, P., Hattingh, J.H., Swart, H.C.: Maximum sizes of graphs with given domination parameters. Discrete Math. 281, 137–148 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  44. DeLaViña, E., Liu, Q., Pepper, R., Waller, B., West, D.B.: Some conjectures of Graffiti.pc on total domination. Congressus Numer. 185, 81–95 (2007)

    Google Scholar 

  45. Desormeaux, W.J., Haynes, T.W., Henning, M.A.: Total domination stable graphs upon edge addition. Discrete Math. 310, 3446–3454 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  46. Desormeaux, W.J., Haynes, T.W., Henning, M.A.: Total domination critical and stable graphs upon edge removal. Discrete Appl. Math. 158, 1587–1592 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  47. Desormeaux, W.J., Haynes, T.W., Henning, M.A.: An extremal problem for total domination stable graphs upon edge removal. Discrete Appl. Math. 159, 1048–1052 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  48. Desormeaux, W.J., Haynes, T.W., Henning, M.A.: Total domination changing and stable graphs upon vertex removal. Discrete Appl. Math. 159, 1548–1554 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  49. Desormeaux, W.J., Haynes, T.W., Henning, M.A.: Relating the annihilation number and the total domination number of a tree. To appear in Discrete Applied Math.

    Google Scholar 

  50. Desormeaux, W.J., Haynes, T.W., Henning, M.A., Yeo, A.: Total domination numbers of graphs with diameter two. To appear in J. Graph Theory

    Google Scholar 

  51. Dorbec, P., Gravier, S., Klavẑar, S., Ŝpacapan, S.: Some results on total domination in direct products of graphs. Discuss. Math. Graph Theory 26, 103–112 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  52. Dorbec, P., Henning, M.A., McCoy, J.: Upper total domination versus upper paired-domination. Quaest. Math. 30, 1–12 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  53. Dorbec, P., Henning, M.A., Rall, D.F.: On the upper total domination number of Cartesian products of graphs. J. Combin. Optim. 16, 68–80 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  54. Dorfling, M., Goddard, W., Hattingh, J.H., Henning, M.A.: Augmenting a graph of minimum degree 2 to have two disjoint total dominating sets. Discrete Math. 300, 82–90 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  55. Dorfling, M., Goddard, W., Henning, M.A.: Domination in planar graphs with small diameter II. Ars Combin. 78, 237–255 (2006)

    MathSciNet  MATH  Google Scholar 

  56. Dorfling, M., Goddard, W., Henning, M.A., Mynhardt, C.M.: Construction of trees and graphs with equal domination parameters. Discrete Math. 306, 2647–2654 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  57. Dorfling, M., Henning, M.A.: Transversals in 5-uniform hypergraphs and total domination in graphs with minimum degree five. Manuscript

    Google Scholar 

  58. Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, New York (1999)

    Book  Google Scholar 

  59. Duh, R., Fürer, M.: Approximation of k-set cover by semi-local optimization. In: Proceedings of the 29th ACM Symposium on Theory of Computing, STOC, pp. 256–264 (1997)

    Google Scholar 

  60. El-Zahar, M., Gravier, S., Klobucar, A.: On the total domination number of cross products of graphs. Discrete Math. 308, 2025–2029 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  61. Fan, G.: On diameter 2-critical graphs. Discrete Math. 67, 235–240 (1987)

    Article  MathSciNet  MATH  Google Scholar 

  62. Favaron, O., Henning, M.A.: Upper total domination in claw-free graphs. J. Graph Theory 44, 148–158 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  63. Favaron, O., Henning, M.A.: Paired domination in claw-free cubic graphs. Graphs Combin. 20, 447–456 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  64. Favaron, O., Henning, M.A.: Total domination in claw-free graphs with minimum degree two. Discrete Math. 308, 3213–3219 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  65. Favaron, O., Henning, M.A.: Bounds on total domination in claw-free cubic graphs. Discrete Math. 308, 3491–3507 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  66. Favaron, O., Henning, M.A., Mynhardt, C.M., Puech, J.: Total domination in graphs with minimum degree three. J. Graph Theory 34(1), 9–19 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  67. Favaron, O., Karami, H., Sheikholeslami, S.M.: Total domination and total domination subdivision number of a graph and its complement. Discrete Math. 308, 4018–4023 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  68. Fellows, M., Hell, P., Seyffarth, K.: Large planar graphs with given diameter and maximum degree. Discrete Appl. Math. 61, 133–154 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  69. Feige, U., Halldórsson, M.M., Kortsarz, G., Srinivasan, A.: Approximating the domatic number. SIAM J. Comput. 32, 172–195 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  70. Füredi, Z.: The maximum number of edges in a minimal graph of diameter 2. J. Graph Theory 16, 81–98 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  71. Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman, San Francisco (1979)

    MATH  Google Scholar 

  72. Gravier, S.: Total domination number of grid graphs. Discrete Appl. Math. 121, 119–128 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  73. Goddard, W.: Automated bounds on recursive structures. Util. Math. 75, 193–210 (2008)

    MathSciNet  MATH  Google Scholar 

  74. Goddard, W., Haynes, T.W., Henning, M.A., van der Merwe, L.C.: The diameter of total domination vertex critical graphs. Discrete Math. 286, 255–261 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  75. Goddard, W., Henning, M.A.: Domination in planar graphs with small diameter. J. Graph Theory 40, 1–25 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  76. Goddard, W., Henning, M.A.: Restricted domination parameters in Graphs. J. Combin. Optim. 13, 353–363 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  77. Goddard, W., Henning, M.A., Swart, H.C.: Some Nordhaus–Gaddum-type results. J. Graph Theory 16, 221–231 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  78. Hanson, D., Wang, P.: A note on extremal total domination edge critical graphs. Util. Math. 63, 89–96 (2003)

    MathSciNet  MATH  Google Scholar 

  79. Harary, F.: The maximum connectivity of a graph. Proc. Nat. Acad. Sci. U.S.A. 48, 1142–1146 (1962)

    Article  MathSciNet  MATH  Google Scholar 

  80. Hartnell, B., Rall, D.F.: Domination in Cartesian products: Vizing’s conjecture. In: Haynes, T.W., Hedetniemi, S.T., Slater, P.J. (eds.) Domination in Graphs: Advanced Topics, pp. 163–189. Marcel Dekker, New York (1998)

    Google Scholar 

  81. Hattingh, J.H.: Restrained and total restrained domination in graphs. Not. S. Afr. Math. Soc. 41, 2–15 (2010)

    MathSciNet  Google Scholar 

  82. Hattingh, J.H., Jonck, E., Joubert, E.J.: An upper bound on the total restrained domination number of a tree. J. Comb. Optim. 20, 205–223 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  83. Hattingh, J.H., Jonck, E., Joubert, E.J.: Bounds on the total restrained domination number of a graph. Graphs Combin. 26, 77–93 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  84. Hattingh, J., Joubert, E., van der Merwe, L.C.: The criticality index of total domination of a path. To appear in Util. Math.

    Google Scholar 

  85. Haynes, T.W., Hedetniemi, S.T., Slater, P.J.: Fundamentals of Domination in Graphs. Marcel Dekker, New York (1998)

    MATH  Google Scholar 

  86. Haynes, T.W., Hedetniemi, S.T., Slater, P.J. (eds): Domination in Graphs: Advanced Topics. Marcel Dekker, New York (1998)

    Google Scholar 

  87. Haynes, T.W., Henning, M.A.: Trees with unique minimum total dominating sets. Discuss. Math. Graph Theory 22, 233–246 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  88. Haynes, T.W., Henning, M.A.: Upper bounds on the total domination number. Ars Combinatoria 91, 243–256 (2009)

    MathSciNet  MATH  Google Scholar 

  89. Haynes, T.W., Henning, M.A.: A characterization of diameter-2-critical graphs with no antihole of length four. Central Eur. J. Math. 10(3), 1125–1132 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  90. Haynes, T.W., Henning, M.A.: A characterization of diameter-2-critical graphs whose complements are diamond-free. Discrete Applied Math. 160, 1979–1985 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  91. Haynes, T.W., Henning, M.A.: The Murty Simon conjecture for bull-free graphs, manuscript

    Google Scholar 

  92. Haynes, T.W., Henning, M.A.: A characterization of P 5-free, diameter-2-critical graphs, manuscript

    Google Scholar 

  93. Haynes, T.W., Henning, M.A., Howard, J.: Locating and total dominating sets in trees. Discrete Appl. Math. 154, 1293–1300 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  94. Haynes, T.W., Henning, M.A., van der Merwe, L.C., and Yeo, A.: On a conjecture of Murty and Simon on diameter two critical graphs. Discrete Math. 311, 1918–1924 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  95. Haynes, T.W., Henning, M.A., van der Merwe, L.C., Yeo, A.: On the existence of k-partite or K p -free total domination edge-critical graphs. Discrete Math. 311, 1142–1149 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  96. Haynes, T.W., Henning, M.A., van der Merwe, L.C., Yeo, A.: A maximum degree theorem for diameter-2-critical graphs, manuscript

    Google Scholar 

  97. Haynes T.W., Henning M.A., van der Merwe L.C., Yeo A.: Progress on the Murty-Simon Conjecture on diameter-2 critical graphs: A Survey. Manuscript.

    Google Scholar 

  98. Haynes, T.W., Henning, M.A., Yeo, A.: A proof of a conjecture on diameter two critical graphs whose complements are claw-free. Discrete Optim. 8, 495–501 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  99. Haynes, T.W., Henning, M.A., Yeo, A.: On a conjecture of Murty and Simon on diameter two critical graphs II. Discrete Math. 312, 315–323 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  100. Haynes, T.W., Markus, L.R.: Generalized maximum degree. Util. Math. 59, 155–165 (2001)

    MathSciNet  MATH  Google Scholar 

  101. Heggernes, P., Telle, J.A.: Partitioning graphs into generalized dominating sets. Nordic J. Comput. 5, 128–142 (1998)

    MathSciNet  MATH  Google Scholar 

  102. Henning, M.A.: Graphs with large total domination number. J. Graph Theory 35(1), 21–45 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  103. Henning, M.A.: Trees with large total domination number. Util. Math. 60, 99–106 (2001)

    MathSciNet  MATH  Google Scholar 

  104. Henning, M.A.: Restricted domination in graphs. Discrete Math. 254, 175–189 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  105. Henning, M.A.: Restricted total domination in Graphs. Discrete Math. 289, 25–44 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  106. Henning, M.A.: A linear Vizing-like relation relating the size and total domination number of a graph. J. Graph Theory 49, 285–290 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  107. Henning, M.A.: Recent results on total domination in graphs: A survey. Discrete Math. 309, 32–63 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  108. Henning, M.A.: A short proof of a result on a Vizing-like problem for integer total domination. J. Combin. Optim. 20, 321–323 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  109. Henning, M.A., Joubert, E.J.: Equality in a linear Vizing-like relation that relates the size and total domination number of a graph, To appear in Discrete Applied Math.

    Google Scholar 

  110. Henning, M.A., Joubert, E.J., Southey, J.: Nordhaus–Gaddum bounds for total domination. Appl. Math. Lett. 24(6), 987–990 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  111. Henning, M.A., Joubert, E.J., Southey, J.: Nordhaus–Gaddum type results for total domination. Discrete Math. Theoret. Comput. Sci. 13(3), 87–96 (2011)

    MathSciNet  Google Scholar 

  112. Henning, M.A., Joubert, E.J., Southey, J.: Multiple factor Nordhaus–Gaddum type results for domination and total domination. Discrete Appl. Math. 160, 1137–1142 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  113. Henning, M.A., Kang, L., Shan, E., Yeo, A.: On matching and total domination in graphs. Discrete Math. 308, 2313–2318 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  114. Henning, M.A., Kazemi, A.P.: k-Tuple total domination in graphs. Discrete Appl. Math. 158, 1006–1011 (2010)

    MathSciNet  MATH  Google Scholar 

  115. Henning, M.A., Kazemi, A.P.: k-Tuple total domination in cross products of graphs. To appear in J. Combin. Optim.

    Google Scholar 

  116. Henning, M.A., Löwenstein, C.: Hypergraphs with large transversal number and with edge sizes at least four. Central Eur. J. Math. 10(3), 1133–1140 (2012)

    Article  MATH  Google Scholar 

  117. Henning, M.A., Löwenstein, C.: Locating-total domination in claw-free cubic graphs. Discrete Math. 312, 3107–3116 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  118. Henning, M.A., Löwenstein, C., Rautenbach, D.: Partitioning a graph into a dominating set, a total dominating set, and something else. Discussiones Math. Graph Theory 30(4), 563–574 (2010)

    Article  MATH  Google Scholar 

  119. Henning, M.A., Löwenstein, C., Rautenbach, D., Southey, J.: Disjoint dominating and total dominating sets in graphs. Discrete Appl. Math. 158, 1615–1623 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  120. Henning, M.A., Maritz, J.E.: Total restrained domination in graphs with minimum degree two. Discrete Math. 308, 1909–1920 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  121. Henning, M.A., McCoy, J.: Total domination in planar graphs of diameter two. Discrete Math. 309, 6181–6189 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  122. Henning, M.A., Rad, N.J.: Total domination vertex critical graphs of high connectivity. Discrete Appl. Math. 157, 1969–1973 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  123. Henning, M.A., Rad, N.: Locating-total domination in graphs. Discrete Appl. Math. 160, 1986–1993 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  124. Henning, M.A., Rall, D.F.: On the total domination number of Cartesian products of graph. Graphs Combin. 21, 63–69 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  125. Henning, M.A., Southey, J.: A note on graphs with disjoint dominating and total dominating sets. Ars Combin. 89, 159–162 (2008)

    MathSciNet  MATH  Google Scholar 

  126. Henning, M.A., Southey, J.: A characterization of graphs with disjoint dominating and total dominating sets. Quaestiones Math. 32, 119–129 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  127. Henning, M.A., van der Merwe, L.C.: The maximum diameter of total domination edge-critical graphs. Discrete Math. 312, 397–404 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  128. Henning, M.A., van der Merwe, L.C.: The maximum diameter of total domination edge-critical graphs. Discrete Math. 312, 397–404 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  129. Henning, M.A., Yeo, A.: Total domination and matching numbers in claw-free graphs. Electronic J. Combin. 13, #59 (2006)

    Google Scholar 

  130. Henning, M.A., Yeo, A.: A transition from total domination in graphs to transversals in hypergraphs. Quaestiones Math. 30, 417–436 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  131. Henning, M.A., Yeo, A.: A new upper bound on the total domination number of a graph. Electronic J. Combin. 14, #R65 (2007)

    Google Scholar 

  132. Henning, M.A., Yeo, A.: Total domination in graphs with given girth. Graphs Combin. 24, 333–348 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  133. Henning, M.A., Yeo, A.: Hypergraphs with large transversal number and with edge sizes at least three. J. Graph Theory 59, 326–348 (2008)

    MathSciNet  MATH  Google Scholar 

  134. Henning, M.A., Yeo, A.: Total domination in 2-connected graphs and in graphs with no induced 6-cycles. J. Graph Theory 60, 55–79 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  135. Henning, M.A., Yeo, A.: Strong transversals in hypergraphs and double total domination in graphs. SIAM J. Discrete Math. 24(4), 1336–1355 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  136. Henning, M.A., Yeo, A.: Perfect matchings in total domination critical graphs. Graphs Combin. 27, 685–701 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  137. Henning, M.A., Yeo, A.: Girth and total domination in graphs. Graphs Combin. 28, 199–214 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  138. Henning, M.A., Yeo, A.: A new lower bound for the total domination number n graphs proving a Graffiti Conjecture. Manuscript

    Google Scholar 

  139. Henning, M.A., Yeo, A.: Total domination and matching numbers in graphs with all vertices in triangles. Discrete Math. 313, 174–181 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  140. Henning, M.A., Yeo, A.: Identifying open codes in cubic graphs. To appear in Graphs Combin.

    Google Scholar 

  141. Henning, M.A., Yeo, A.: 2-Colorings in k-regular k-uniform hypergraphs. To appear in European J. Combin.

    Google Scholar 

  142. Ho, P.T.: A note on the total domination number. Util. Math. 77, 97–100 (2008)

    MathSciNet  MATH  Google Scholar 

  143. Hoffman, A.J., Singleton, R.R.: On Moore graphs with diameter 2 and 3. IBM J. Res. Develop. 5, 497–504 (1960)

    Article  MathSciNet  Google Scholar 

  144. Honkala, I., Laihonen, T., Ranto, S.: On strongly identifying codes. Discrete Math. 254, 191–205 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  145. Imrich, W., Klavžar, S.: Product Graphs: Structure and Recognition. Wiley, New York (2000)

    MATH  Google Scholar 

  146. Jiang, H., Kang, L.: Total restrained domination in claw-free graphs. J. Comb. Optim. 19, 60–68 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  147. Jiang, H., Kang, L., Shan, E.: Total restrained domination in cubic graphs. Graphs Combin. 25, 341–350 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  148. Jiang, H., Kang, L., Shan, E.: Graphs with large total restrained domination number. Util. Math. 81, 53–63 (2010)

    MathSciNet  MATH  Google Scholar 

  149. Joubert, E.J.: Total restrained domination in claw-free graphs with minimum degree at least two. Discrete Appl. Math. 159, 2078–2097 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  150. Keil, J.M.: Total domination in interval graphs. Inform. Process. Lett. 22, 171–174 (1986)

    Article  MathSciNet  MATH  Google Scholar 

  151. Keil, J.M.: The complexity of domination problems in circle graphs. Discrete Appl. Math. 42, 51–63 (1993)

    Article  MathSciNet  MATH  Google Scholar 

  152. Khodkar, A., Mojdeh, D.A., Kazemi, A.P.: Domination in Harary graphs. Bull. ICA 49, 61–78 (2007)

    MathSciNet  MATH  Google Scholar 

  153. König, D.: Über Graphen und ihre Anwendung auf Determinantheorie und Mengenlehre. Math. Ann. 77, 453–465 (1916)

    Article  MathSciNet  MATH  Google Scholar 

  154. Kratsch, D., Stewart, L.: Domination on cocomparability graphs. SIAM J. Discrete Math. 6, 400–417 (1993)

    Article  MathSciNet  MATH  Google Scholar 

  155. Kratsch, D., Stewart, L.: Total domination and transformation. Inform. Process. Lett. 63, 167–170 (1997)

    Article  MathSciNet  Google Scholar 

  156. Kratsch, D.: Domination and total domination on asteroidal triple-free graphs. Proceedings of the 5th Twente Workshop on Graphs and Combinatorial Optimization (Enschede, 1997). Discrete Appl. Math. 99, 111–123 (2000)

    Google Scholar 

  157. Lam, P.C.B., Wei, B.: On the total domination number of graphs. Util. Math. 72, 223–240 (2007)

    MathSciNet  MATH  Google Scholar 

  158. Laskar, R.C., Pfaff, J.: Domination and irredundance in split graphs. Technicial Report 430, Clemson University, Dept. Math. Sciences (1983)

    Google Scholar 

  159. Laskar, R.C., Pfaff, J., Hedetniemi, S.M., Hedetniemi, S.T.: On the algorithmic complexity of total domination. SIAM J. Algebr. Discrete Meth. 5, 420–425 (1984)

    Article  MathSciNet  MATH  Google Scholar 

  160. Li, N., Hou, X.: On the total {k}-domination number of Cartesian products of graphs. J. Comb. Optim. 18, 173–178 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  161. Li, N., Hou, X.: Total domination in the Cartesian product of a graph and K 2 or C n . Util. Math. 83, 313–322 (2010)

    MathSciNet  Google Scholar 

  162. Lichiardopol, N.: On a conjecture on total domination in claw-free cubic graphs: proof and new upper bound. Australasian J. Combin. 51, 7–28 (2011)

    MathSciNet  MATH  Google Scholar 

  163. Loizeaux, M., van der Merwe, L.: A total domination vertex-critical graph of diameter two. Bull. ICA 48, 63–65 (2006)

    MATH  Google Scholar 

  164. MacGillivray, G., Seyffarth, K.: Domination numbers of planar graphs. J. Graph Theory 22, 213–229 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  165. McRae, A.A.: Generalizing NP-completeness proofs for bipartite and chordal graphs. PhD thesis, Clemson University (1994)

    Google Scholar 

  166. Meir, A., Moon, J.W.: Relations between packing and covering numbers of a tree. Pacific J. Math. 61, 225–233 (1975)

    Article  MathSciNet  MATH  Google Scholar 

  167. Mitchell, S.L., Cockayne, E.J., Hedetniemi, S.T.: Linear algorithms on recursive representations of trees. J. Comput. Syst. Sci. 18, 76–85 (1979)

    Article  MathSciNet  MATH  Google Scholar 

  168. Nordhaus, E.A., Gaddum, J.W.: On complementary graphs. Amer. Math. Monthly 63, 175–177 (1956)

    Article  MathSciNet  MATH  Google Scholar 

  169. Nowakowski, R.J., Rall, D.F.: Associative graph products and their independence, domination and coloring numbers. Discuss. Math. Graph Theory 16, 53–79 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  170. Pfaff, J., Laskar, R.C., Hedetniemi, S.T.: NP-completeness of total and connected domination and irredundance for bipartite graphs. Technicial Report 428, Dept. Math. Sciences, Clemson University (1983)

    Google Scholar 

  171. Philip, G.: The kernelization complexity of some domination and covering problems. Ph.D. Thesis

    Google Scholar 

  172. Plesník, J.: Critical graphs of given diameter. Acta F.R.N Univ. Comen. Math. 30, 71–93 (1975)

    Google Scholar 

  173. Plesní, k.P.: Bounds on chromatic numbers of multiple factors of a complete graph. J. Graph Theory 2, 9–17 (1978)

    Google Scholar 

  174. Pradhan, D.: Complexity of certain functional variants of total domination in chordal bipartite graphs. Discrete Math. Algorithms Appl. 4(3), 1250045 (19 p) (2012)

    Google Scholar 

  175. Rall, D.F.: Total domination in categorical products of graphs. Discuss. Math. Graph Theory 25, 35–44 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  176. Ramalingam, G., Rangan, C.P.: Total domination in interval graphs revisited. Inform. Process. Lett. 27, 17–21 (1988)

    Article  MathSciNet  MATH  Google Scholar 

  177. Rao, A., Rangan, C.P.: Optimal parallel algorithms on circular-arc graphs. Inform. Process. Lett. 33, 147–156 (1989)

    Article  MathSciNet  MATH  Google Scholar 

  178. Robertson, N., Seymour, P.D.: Graph minors. II. Algorithmic aspects of tree-width. J. Algorithms 7(3), 309–322 (1986)

    MathSciNet  MATH  Google Scholar 

  179. Sanchis, L.A.: Bounds related to domination in graphs with minimum degree two. J. Graph Theory 25, 139–152 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  180. Schaudt, O.: On the existence of total dominating subgraphs with a prescribed additive hereditary property. Discrete Math. 311, 2095–2101 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  181. Sanchis, L.A.: Relating the size of a connected graph to its total and restricted domination numbers. Discrete Math. 283, 205–216 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  182. Seo, S.J., Slater, P.J.: Open neighborhood locating-dominating sets. Australasian J. Combin. 46, 109–120 (2010)

    MathSciNet  MATH  Google Scholar 

  183. Seo, S.J., Slater, P.J.: Open neighborhood locating-dominating in trees. Discrete Appl. Math. 159, 484–489 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  184. Shan, E., Kang, L., Henning, M.A.: Erratum to: A linear Vizing-like relation relating the size and total domination number of a graph. J. Graph Theory 54, 350–353 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  185. Singleton, R.R.: There is no irregular Moore graph. Amer. Math. Monthly 75, 42–43 (1968)

    Article  MathSciNet  MATH  Google Scholar 

  186. Slater, P.J.: Dominating and location in acyclic graphs. Networks 17, 55–64 (1987)

    Article  MathSciNet  MATH  Google Scholar 

  187. Slater, P.J.: Dominating and reference sets in graphs. J. Math. Phys. Sci. 22, 445–455 (1988)

    MathSciNet  MATH  Google Scholar 

  188. Southey, J., Henning, M.A.: On a conjecture on total domination in claw-free cubic graphs. Discrete Math. 310, 2984–2999 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  189. Southey, J., Henning, M.A.: Dominating and total dominating partitions in cubic graphs. Central Eur. J. Math. 9(3), 699–708 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  190. Southey, J., Henning, M.A.: An improved upper bound on the total restrained domination number in cubic graphs. Graphs Combin. 8, 547–554 (2012)

    Article  MathSciNet  Google Scholar 

  191. Southey, J., Henning, M.A.: Edge weighting functions on dominating sets. To appear in J. Graph Theory

    Google Scholar 

  192. O, S., West, D.B.: Balloons, cut-edges, matchings, and total domination in regular graphs of odd degree. J. Graph Theory 64, 116–131 (2010)

    Google Scholar 

  193. Sumner, D.P., Blitch, P.: Domination critical graphs. J. Combin. Theory Ser. B 34, 65–76 (1983)

    Article  MathSciNet  MATH  Google Scholar 

  194. Sun, L.: An upper bound for the total domination number. J. Beijing Inst. Tech. 4, 111–114 (1995)

    MathSciNet  MATH  Google Scholar 

  195. Telle, J.A.: Complexity of domination-type problems in graphs. Nordic J. Comput. 1, 157–171 (1994)

    MathSciNet  Google Scholar 

  196. Telle, J.A., Proskurowski, A.: Algorithms for vertex partitioning problems on partial k-trees. SIAM J. Discrete Math. 10, 529–550 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  197. Thomassé, S., Yeo, A.: Total domination of graphs and small transversals of hypergraphs. Combinatorica 27, 473–487 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  198. Thomassen, C.: The even cycle problem for directed graphs. J. Am. Math. Soc. 5, 217–229 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  199. Turán, P.: Eine Extremalaufgabe aus der Graphentheorie. Mat. Fiz. Lapok 48, 436–452 (1941)

    MathSciNet  Google Scholar 

  200. Tuza, Z.s.: Covering all cliques of a graph. Discrete Math. 86, 117–126 (1990)

    Google Scholar 

  201. Tuza, Z.s.: Hereditary domination in graphs: characterization with forbidden induced subgraphs. SIAM J. Discrete Math. 22, 849–853 (2008)

    Google Scholar 

  202. Van der Merwe, L.C.: Total domination edge critical graphs. Ph.D. Dissertation, University of South Africa (1998)

    Google Scholar 

  203. Van der Merwe, L.C., Haynes, T.W., Mynhardt, C.M.: Total domination edge critical graphs. Util. Math. 54, 229–240 (1998)

    MathSciNet  MATH  Google Scholar 

  204. Van der Merwe, L.C., Loizeaux, M.: 4 t -Critical graphs with maximum diameter. J. Combin. Math. Combin. Comput. 60, 65–80 (2007)

    MathSciNet  MATH  Google Scholar 

  205. Wang, H., Kang, L., Shan, E.: Matching properties on total domination vertex critical graphs. Graphs Combin. 25, 851–861 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  206. Xu, J.: A proof of a conjecture of Simon and Murty (in Chinese). J. Math. Res. Exposition 4, 85–86 (1984)

    MathSciNet  MATH  Google Scholar 

  207. Yeo, A.: Relationships between total domination, order, size and maximum degree of graphs. J. Graph Theory 55(4), 325–337 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  208. Yeo, A.: Manuscript

    Google Scholar 

  209. Yuster, R.: The domatic number of regular and almost regular graphs, mansucript (see http://arxiv.org/pdf/math/0111257v1.pdf)

  210. Vizing, V.G.: A bound on the external stability number of a graph. Dokl. Akad. Nauk SSSR 164, 729–731 (1965)

    MathSciNet  Google Scholar 

  211. Zelinka, B.: Total domatic number and degrees of vertices of a graph. Math. Slovaca 39, 7–11 (1989)

    MathSciNet  MATH  Google Scholar 

  212. Zelinka, B.: Domatic numbers of graphs and their variants: A survey. In: Haynes, T.W., Hedetniemi, S.T., Slater, P.J. (eds.) Domination in Graphs: Advanced Topics, pp. 351–377. Marcel Dekker, New York (1998)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, University of Johannesburg, Johannesburg, South Africa

    Michael A. Henning & Anders Yeo

Authors
  1. Michael A. Henning
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Anders Yeo
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer Science+Business Media New York

About this chapter

Cite this chapter

Henning, M.A., Yeo, A. (2013). Total Domination in Planar Graphs. In: Total Domination in Graphs. Springer Monographs in Mathematics. Springer, New York, NY. https://doi.org/10.1007/978-1-4614-6525-6_6

Download citation

Publish with us

Policies and ethics

Search

Navigation