Domination in Graphs

  • Nawarat Ananchuen
  • Watcharaphong Ananchuen
  • Michael D. Plummer
Chapter

Abstract

A set of vertices S in a graph G dominates G if every vertex in G is either in S or adjacent to a vertex in S. The size of any smallest dominating set is called the domination number of G. Two variants on this concept that have attracted recent interest are total domination and connected domination. A set of vertices S is a total dominating set if every vertex in the graph is adjacent to a vertex of S and S is a connected dominating set if it is dominating and, in addition, induces a connected subgraph. The size of any smallest total dominating set in G is called the total domination number of G and the size of a smallest connected dominating set is the connected domination number of G. These simple, yet wide-ranging, graph-theoretic concepts have a multitude of real-world applications. There are already in print several surveys of results on domination; therefore, in this chapter we adopt a slightly different approach. We begin by surveying results on bounding the three domination numbers. We then focus on criticality concepts for domination. The two types of criticality most widely studied to date are graphs for which the domination number decreases upon the addition of any missing edge and the graphs for which the domination number decreases upon the deletion of any vertex. Recently, there has been increased activity in the study of these critical concepts and we survey these new results, focusing especially upon matching in critical graphs.

Keywords

Domination Total domination Connected domination Edge critical Vertex critical Matching 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Ananchuen N (2007) On domination critical graphs with cutvertices having connected domination number 3. Int Math Forum 2:3041–3052MATHMathSciNetGoogle Scholar
  2. 2.
    Ananchuen N, Plummer MD (2003) Some results related to the toughness of 3-domination critical graphs. Discrete Math 272:5–15MATHMathSciNetCrossRefGoogle Scholar
  3. 3.
    Ananchuen N, Plummer MD (2004) Matching properties in domination critical graphs. Discrete Math 277:1–13MATHMathSciNetCrossRefGoogle Scholar
  4. 4.
    Ananchuen N, Plummer MD (2005) Matching in 3-vertex-critical graphs: the even case. Networks 45:210–213MATHMathSciNetCrossRefGoogle Scholar
  5. 5.
    Ananchuen N, Plummer MD (2006) Erratum to: Matching properties in domination critical graphs. Discrete Math 306:291–291MathSciNetCrossRefGoogle Scholar
  6. 6.
    Ananchuen N, Plummer MD (2006) Erratum to: Some results related to the toughness of 3-domination critical graphs. Discrete Math 306:292MathSciNetCrossRefGoogle Scholar
  7. 7.
    Ananchuen N, Plummer MD (2006) On the connectivity and matchings in 3-vertex-critical claw-free graphs. Utilitas Math 69:85–96MATHMathSciNetGoogle Scholar
  8. 8.
    Ananchuen N, Plummer MD (2006) Some results related to the toughness of 3-domination critical graphs II. Utilitas Math 70:11–32MATHMathSciNetGoogle Scholar
  9. 9.
    Ananchuen N, Plummer MD (2007) Matchings in 3-vertex-critical graphs: the odd case. Discrete Math 307:1651–1658MATHMathSciNetCrossRefGoogle Scholar
  10. 10.
    Ananchuen N, Plummer MD (2007) 3-Factor-criticality in domination critical graphs. Discrete Math 307:3006–3015MATHMathSciNetCrossRefGoogle Scholar
  11. 11.
    Ananchuen N, Ananchuen W, Plummer MD (2008a) Matching properties in connected domination critical graphs. Discrete Math 308:1260–1267MATHMathSciNetCrossRefGoogle Scholar
  12. 12.
    Ananchuen W, Ananchuen N, Plummer MD (2008b) Vertex criticality for connected domination. Utilitas Math (to appear)Google Scholar
  13. 13.
    Ananchuen W, Ananchuen N, Plummer MD (2008c) Connected domination: vertex criticality and matchings, (submitted) (to appear)Google Scholar
  14. 14.
    Ao S (1994) Independent domination critical graphs. M.Sc. thesis, Department of Mathematics and Statistics, University of VictoriaGoogle Scholar
  15. 15.
    Archdeacon D et al. (2004) Some remarks on domination. J Graph Theory 46:207–210MATHMathSciNetCrossRefGoogle Scholar
  16. 16.
    Baogen X, Cockayne EJ, Haynes TW, Hedetniemi ST, Shangchao Z (2000) Extremal graphs for inequalities involving domination parameters. Discrete Math 216:1–10MATHMathSciNetCrossRefGoogle Scholar
  17. 17.
    Berge C (1973) Graphs and hypergraphs. North-Holland, AmsterdamMATHGoogle Scholar
  18. 18.
    Blitch PM (1983) Domination in graphs. Ph.D. thesis, Department of Mathematics and Statistics, University of South CarolinaGoogle Scholar
  19. 19.
    Bo C, Liu B (1996) Some inequalities about connected domination number. Discrete Math 159:241–245MATHMathSciNetCrossRefGoogle Scholar
  20. 20.
    Bollobás B, Cockayne EJ (1979) Graph theoretic parameters concerning domination, independence and irredundance. J Graph Theory 3:241–250MATHMathSciNetCrossRefGoogle Scholar
  21. 21.
    Bondy JA, Chvátal V (1976) A method in graph theory. Discrete Math 15:111–135MATHMathSciNetCrossRefGoogle Scholar
  22. 22.
    Bondy JA, Murty USR (1976) Graph theory with applications. Macmillan, LondonGoogle Scholar
  23. 23.
    Brigham RC, Carrington JR, Vitray RP (2000) Connected graphs with maximum total domination number. J Combin Math Combin Comput 34:81–96MATHMathSciNetGoogle Scholar
  24. 24.
    Brigham RC, Chinn PZ, Dutton RD (1984) A study of vertex domination critical graphs. Tech. Report M-2, Department of Mathematics, University of Central FloridaGoogle Scholar
  25. 25.
    Brigham RC, Chinn PZ, Dutton RD (1988) Vertex domination-critical graphs. Networks 18:173–179MATHMathSciNetCrossRefGoogle Scholar
  26. 26.
    Brigham RC, Haynes TW, Henning MA, Rall DF (2005) Bicritical domination. Discrete Math 305:18–32MATHMathSciNetCrossRefGoogle Scholar
  27. 27.
    Burton T, Sumner DP (2006) Domination dot-critical graphs. Discrete Math 306:11–18MATHMathSciNetCrossRefGoogle Scholar
  28. 28.
    Burton T, Sumner DP (2007) γ-Excellent, critically dominated, end-dominated, and dot-critical trees are equivalent. Discrete Math 307:683–693MATHMathSciNetCrossRefGoogle Scholar
  29. 29.
    Caro Y, Roditty Y (1985) On the vertex-independence number and star decomposition of graphs. Ars Combinatoria 20:167–180MATHMathSciNetGoogle Scholar
  30. 30.
    Caro Y, Roditty Y (1990) A note on the k-domination number of a graph. Int J Math Sci 13:205–206MATHMathSciNetCrossRefGoogle Scholar
  31. 31.
    Chang GJ (1998) Algorithmic aspects of domination in graphs. In: Du D-Z, Pardalos PM (eds) Handbook of combinatorial optimization, vol 3. Kluwer, Boston, pp 339–405Google Scholar
  32. 32.
    Chen Y, Edwin Cheng TC, Ng CT (2008) Hamilton-connectivity of 3-domination critical graphs with \(\alpha = \delta + 1 \geq 5\). Discrete Math 308:1296–1307MATHMathSciNetCrossRefGoogle Scholar
  33. 33.
    Chen XG, Sun L, Ma D-X (2004) Connected domination critical graphs. Appl Math Lett 17:503–507MATHMathSciNetCrossRefGoogle Scholar
  34. 34.
    Chen Y, Tian F (2003) A new proof of Wojcicka’s conjecture. Discrete Appl Math 127: 545–554MATHMathSciNetCrossRefGoogle Scholar
  35. 35.
    Chen Y, Tian F, Wei B (2002) Codiameters of 3-connected 3-domination critical graphs. J Graph Theory 39:76–85MATHMathSciNetCrossRefGoogle Scholar
  36. 36.
    Chen Y, Tian F, Wei B (2002) The 3-domination-critical graphs with toughness one. Utilitas Math 61:239–253MATHMathSciNetGoogle Scholar
  37. 37.
    Chen Y, Tian F, Wei B (2003) Hamilton-connectivity of 3-domination-critical graphs with α ≤ δ. Discrete Math 271:1–12MATHMathSciNetCrossRefGoogle Scholar
  38. 38.
    Chen Y, Tian F, Zhang Y (2002) Hamilton-connectivity of 3-domination critical graphs with \(\alpha = \delta + 2\). Eur J Combinator 23:777–784MATHMathSciNetCrossRefGoogle Scholar
  39. 39.
    Chengye Z, Yuansheng Y, Linlin S (2008) Domination dot-critical graphs with no critical vertices. Discrete Math 308:3241–3248MATHMathSciNetCrossRefGoogle Scholar
  40. 40.
    Clark WE, Shekhtman B, Suen S (1998) Upper bounds for the domination number of a graph. Congr Numer 132:99–123MATHMathSciNetGoogle Scholar
  41. 41.
    Clark WE, Suen S (2000) An inequality related to Vizing’s conjecture. Electron J Combinator 7(4):3Google Scholar
  42. 42.
    Cockayne EJ (1978) Domination of undirected graphs – a survey. In: Alavi, Y., Lick, D.R. (eds) Theory and applications of graphs in America’s bicentennial year. Springer, Berlin, pp 141–147Google Scholar
  43. 43.
    Cockayne EJ, Dawes RM, Hedetniemi ST (1980) Total domination in graphs. Networks 10:211–219MATHMathSciNetCrossRefGoogle Scholar
  44. 44.
    Cockayne EJ, Hedetniemi ST (1977) Towards a theory of domination in graphs. Networks 7:247–261MATHMathSciNetCrossRefGoogle Scholar
  45. 45.
    Colbourn CJ, Stewart LK (1990) Permutation graphs: connected domination and Steiner trees. Discrete Math 86:179–189MATHMathSciNetCrossRefGoogle Scholar
  46. 46.
    Cropper M, Greenwell D, Hilton AJW, Kostochka AV (2005) The domination number of cubic Hamiltonian graphs. AKCE Int J Graph Combinator 2:137–144MATHMathSciNetGoogle Scholar
  47. 47.
    DeLaViña E, Liu Q, Pepper R, Waller B, West DB (2007) Some conjectures of Graffiti.pc on total domination. Congr Numer 185:81–95MATHMathSciNetGoogle Scholar
  48. 48.
    Dorfling M, Goddard W, Henning MA (2006) Domination in planar graphs with small diameter II. Ars Combinatoria 78:237–255MATHMathSciNetGoogle Scholar
  49. 49.
    Duchet P, Meyniel H (1982) On Hadwiger’s number and the stability number. In: Bollobás B (ed) Graph theory. Annals of Discrete Mathematics, vol 13. North-Holland, Amsterdam, pp 71–74Google Scholar
  50. 50.
    Duckworth W, Mans B (2002) On the connected domination number of random regular graphs. In: Ibarra OH, Zhang L (eds) Computing and combinatorics. Lecture notes in computer science, vol 2387. Springer, Berlin, pp 210–219Google Scholar
  51. 51.
    Edwin Cheng TC, Chen Y, Ng CT (2009) Codiameters of 3-domination critical graphs with toughness more than one. Discrete Math 309:1067–1078MATHMathSciNetCrossRefGoogle Scholar
  52. 52.
    Favaron O, Flandrin E, Ryjác̆ek Z (1997) Factor-criticality and matching extension in DCT-graphs. Discuss Math Graph Theory 17:271–278Google Scholar
  53. 53.
    Favaron O, Henning MA (2004) Paired-domination in claw-free cubic graphs. Graph Combinator 20:447–456MATHMathSciNetCrossRefGoogle Scholar
  54. 54.
    Favaron O, Henning MA (2008) Total domination in claw-free graphs with minimum degree 2. Discrete Math 308:3213–3219MATHMathSciNetCrossRefGoogle Scholar
  55. 55.
    Favaron O, Henning MA (2008) Bounds on total domination in claw-free cubic graphs. Discrete Math 308:3491–3507MATHMathSciNetCrossRefGoogle Scholar
  56. 56.
    Favaron O, Kratsch D (1991) Ratios of domination parameters. In: Kulli VR (ed) Advances in graph theory. Vishwa, Gulbarga, pp 173–182Google Scholar
  57. 57.
    Favaron O, Sumner DP, Wojcicka E (1994) The diameter of domination k-critical graphs. J Graph Theory 18:723–734MATHMathSciNetCrossRefGoogle Scholar
  58. 58.
    Favaron O, Tian F, Zhang L (1997) Independence and hamiltonicity in 3-domination-critical graphs. J Graph Theory 25:173–184MATHMathSciNetCrossRefGoogle Scholar
  59. 59.
    Flandrin E, Tian F, Wei B, Zhang L (1999) Some properties of 3-domination-critical graphs. Discrete Math 205:65–76MATHMathSciNetCrossRefGoogle Scholar
  60. 60.
    Frendrup A, Henning MA, Randerath B, Vestergaard PD (2009) An upper bound on the domination number of a graph with minimum degree 2. Discrete Math 309:639–646MATHMathSciNetCrossRefGoogle Scholar
  61. 61.
    Fujita S, Kameda T, Yamashita M (1995) A resource assignment problem on graphs. In: Staples J, Eades P, Katoh N, Moffat A (eds) Algorithms and computation. Lecture notes in computer science, vol 1004. Springer, London, pp 418–427Google Scholar
  62. 62.
    Fujita S, Kameda T, Yamashita M (2000) A study on r-configurations-a resource arrangement problem. SIAM J Discrete Math 13:227–254MathSciNetCrossRefGoogle Scholar
  63. 63.
    Fulman J (1994) Domination in vertex and edge critical graphs. Manuscript, Department of Mathematics, Harvard UniversityGoogle Scholar
  64. 64.
    Fulman J, Hanson D, MacGillivray G (1995) Vertex domination-critical graphs. Networks 25:41–43MATHMathSciNetCrossRefGoogle Scholar
  65. 65.
    Garey MR, Johnson DS (1979) Computers and intractability: a guide to the theory of NP-completeness. W.H. Freeman, San Francisco, CAMATHGoogle Scholar
  66. 66.
    Goddard W, Haynes TW, Henning MA, van der Merwe LC (2004) The diameter of total domination vertex critical graphs. Discrete Math 286:255–261MATHMathSciNetCrossRefGoogle Scholar
  67. 67.
    Goddard W, Henning MA (2002) Domination in planar graphs with small diameter. J Graph Theory 40:1–25MATHMathSciNetCrossRefGoogle Scholar
  68. 68.
    Hanson D (1993) Hamilton closures in domination critical graphs. J Combin Math Combin Comput 13:121–128MATHMathSciNetGoogle Scholar
  69. 69.
    Hanson D, Wang P (2003) A note on extremal total domination edge critical graphs. Utilitas Math 63:89–96MATHMathSciNetGoogle Scholar
  70. 70.
    Harant J, Rautenbach D (2009) Domination in bipartite graphs. Discrete Math 309:113–122MATHMathSciNetCrossRefGoogle Scholar
  71. 71.
    Haynes TW, Hedetniemi ST, Slater PJ (1998) Fundamentals of domination in graphs. Marcel Dekker, New YorkMATHGoogle Scholar
  72. 72.
    Haynes TW, Hedetniemi ST, Slater PJ (eds) (1998) Domination in graphs – advanced topics. Marcel Dekker, New YorkMATHGoogle Scholar
  73. 73.
    Haynes TW, Henning MA (1998) Domination critical graphs with respect to relative complements. Australas J Combinator 18:115–126MATHMathSciNetGoogle Scholar
  74. 74.
    Haynes TW, Henning MA (2009) Upper bounds on the total domination number. Ars Combinatoria 91:243–256MathSciNetGoogle Scholar
  75. 75.
    Haynes TW, Phillips JB, Slater PJ (1999) Realizability of (j, t)-critical graphs for sets of values. Congr Numer 137:65–75MATHMathSciNetGoogle Scholar
  76. 76.
    Hedetniemi ST, Laskar R (1984) Connected domination in graphs. In: Bollobás B (ed) Graph theory and combinatorics. Academic, London, pp 209–217Google Scholar
  77. 77.
    Hedetniemi ST, Laskar RC (1990) Bibliography on domination in graphs and some basic definitions of domination parameters. Discrete Math 86:257–277MATHMathSciNetCrossRefGoogle Scholar
  78. 78.
    Hellwig A, Volkmann L (2006) Some upper bounds for the domination number. J Combin Math Combin Comput 57:187–209MATHMathSciNetGoogle Scholar
  79. 79.
    Henning MA (1999) A characterisation of graphs with minimum degree 2 and domination number exceeding a third their size. J Combin Math Combin Comput 31:45–64MATHMathSciNetGoogle Scholar
  80. 80.
    Henning MA (2000) Graphs with large total domination number. J Graph Theory 35:21–45MATHMathSciNetCrossRefGoogle Scholar
  81. 81.
    Henning MA (2005) A linear Vizing-like relation relating the size and total domination number of a graph. J Graph Theory 49:285–290MATHMathSciNetCrossRefGoogle Scholar
  82. 82.
    Henning MA (2009) A survey of selected recent results on total domination in graphs. Discrete Math 309:32–63MATHMathSciNetCrossRefGoogle Scholar
  83. 83.
    Henning MA, Kang L, Shan E, Yeo A (2008) On matching and total domination in graphs. Discrete Math 308:2313–2318MATHMathSciNetCrossRefGoogle Scholar
  84. 84.
    Henning MA, Oellermann OR, Swart HC (2003) Distance domination critical graphs. J Combin Math Combin Comput 44:33–45MATHMathSciNetGoogle Scholar
  85. 85.
    Henning MA, Yeo A (2006) Total domination and matching numbers in claw-free graphs. Electron J Combinator 13, # R 59, 28Google Scholar
  86. 86.
    Henning MA, Yeo A (2008) Total domination in graphs with given girth. Graph Combinator 24:333–348MATHMathSciNetCrossRefGoogle Scholar
  87. 87.
    Henning MA, Yeo A (2007) A new upper bound on the total domination number of a graph. Electron J Combinator 14, # R 65, 10Google Scholar
  88. 88.
    Ho PT (2008) A note on the total domination number. Utilitas Math 77:97–100MATHGoogle Scholar
  89. 89.
    Jinquan D (1995) Some results on 3-domination critical graphs. Acta Sci Nat Univ NeiMonggol 26:39–42Google Scholar
  90. 90.
    Kawarabayashi K, Plummer MD, Saito A (2006) Domination in a graph with a 2-factor. J Graph Theory 52:1–6MATHMathSciNetCrossRefGoogle Scholar
  91. 91.
    Kleitman DJ, West DB (1991) Spanning trees with many leaves. SIAM J Discrete Math 4: 99–106MATHMathSciNetCrossRefGoogle Scholar
  92. 92.
    Kostochka AV, Stodolsky BY (2005) On domination in connected cubic graphs. Discrete Math 304:45–50MATHMathSciNetCrossRefGoogle Scholar
  93. 93.
    Kostochka AV, Stodolsky BY (2009) An upper bound on the domination number of n-vertex connected cubic graphs. Discrete Math 309:1142–1162MATHMathSciNetCrossRefGoogle Scholar
  94. 94.
    Lam PCB, Wei B (2007) On the total domination number of graphs. Utilitas Math 72:223–240MATHMathSciNetGoogle Scholar
  95. 95.
    Las Vergnas M (1975) A note on matchings in graphs, Colloque sur la Théorie des Graphes (Paris, 1974) Cahiers Centre Études Rech Oṕer 17:257–260Google Scholar
  96. 96.
    Laskar R, Walikar HB (1981) On domination related concepts in graph theory. In: Rao SB (ed) Combinatorics and graph theory. Lecture notes in mathematics, vol 885. Springer, Berlin, pp 308–320Google Scholar
  97. 97.
    Liu CL (1968) Introduction to combinatorial mathematics. McGraw-Hill, New YorkMATHGoogle Scholar
  98. 98.
    Liu H, Sun L (2004) On domination number of 4-regular graphs. Czechoslovak Math J 54:889–898MATHMathSciNetCrossRefGoogle Scholar
  99. 99.
    Liu G, Yu Q (1998) On n-edge-deletable and n-critical graphs. Bull Inst Combinator Appl 24:65–72MATHMathSciNetGoogle Scholar
  100. 100.
    Liying K, Erfang S (1995) On connected domination number of a graph. In: Ku T-H (ed) Combinatorics and graph theory’95, vol 1. World Science, River Edge, NJ, pp 199–204Google Scholar
  101. 101.
    Lovász L, Plummer MD (1986) Matching theory. Annals of Discrete Mathematics, vol 29. North-Holland, AmsterdamGoogle Scholar
  102. 102.
    Löwenstein C, Rautenbach D (2008) Domination in graphs of minimum degree at least two and large girth. Graph Combinator 24:37–46MATHCrossRefGoogle Scholar
  103. 103.
    MacGillivray G, Seyffarth K (1996) Domination numbers of planar graphs. J Graph Theory 22:213–229MATHMathSciNetCrossRefGoogle Scholar
  104. 104.
    McCuaig W, Shepherd B (1989) Domination in graphs with minimum degree two. J Graph Theory 13:749–762MATHMathSciNetCrossRefGoogle Scholar
  105. 105.
    Mojdeh DA, Rad NJ (2006) On the total domination critical graphs. Electron Notes Discrete Math 24:89–92MathSciNetCrossRefGoogle Scholar
  106. 106.
    Mojdeh DA, Rad NJ (2007) On an open problem concerning total domination critical graphs. Expositiones Math 25:175–179MATHMathSciNetCrossRefGoogle Scholar
  107. 107.
    Moodley L (2000) Wojcicka’s theorem: complete, consolidated proof. J Combin Math Combin Comput 33:129–179MATHMathSciNetGoogle Scholar
  108. 108.
    Moscarini M (1993) Doubly chordal graphs, Steiner trees, and connected domination. Networks 23:59–69MATHMathSciNetCrossRefGoogle Scholar
  109. 109.
    Mynhardt CM (1998) On two conjectures concerning 3-domination-critical graphs. Congr Numer 135:119–138MATHMathSciNetGoogle Scholar
  110. 110.
    Newman-Wolfe RE, Dutton RD, Brigham RC (1988) Connecting sets in graphs – a domination related concept. Congr Numer 67:67–76MathSciNetGoogle Scholar
  111. 111.
    Ore O (1962) Theory of graphs. Am Math Soc Colloq Publ 38Google Scholar
  112. 112.
    Paris M (1994) Note: the diameter of edge domination critical graphs. Networks 24:261–262MATHMathSciNetCrossRefGoogle Scholar
  113. 113.
    Paris M, Sumner DP, Wojcicka E (1999) Edge-domination-critical graphs with cut-vertices. Congr Numer 141:111–117MATHMathSciNetGoogle Scholar
  114. 114.
    Payan C, Xuong NH (1982) Domination-balanced graphs. J Graph Theory 6:23–32MATHMathSciNetCrossRefGoogle Scholar
  115. 115.
    Phillips JB, Haynes TW (2000) A generalization of domination critical graphs. Utilitas Math 58:129–144MATHMathSciNetGoogle Scholar
  116. 116.
    Rautenbach D (2008) A note on domination, girth and minimum degree. Discrete Math 308:2325–2329MATHMathSciNetCrossRefGoogle Scholar
  117. 117.
    Reed B (1996) Paths, stars and the number three. Comb Probab Comput 5:277–295MATHCrossRefGoogle Scholar
  118. 118.
    Sampathkumar E, Walikar HB (1979) The connected domination number of a graph. J Math Phys Sci 13:607–613MATHMathSciNetGoogle Scholar
  119. 119.
    Sanchis LA (1997) Bounds related to domination in graphs with minimum degree two. J Graph Theory 25:139–152MATHMathSciNetCrossRefGoogle Scholar
  120. 120.
    Sanchis LA (2000) On the number of edges in graphs with a given connected domination number. Discrete Math 214:193–210MATHMathSciNetCrossRefGoogle Scholar
  121. 121.
    Shan E, Kang L, Henning MA (2007) Erratum to: A linear Vizing-like relation relating the size and total domination number of a graph. J Graph Theory 54:350–353MATHMathSciNetCrossRefGoogle Scholar
  122. 122.
    Shiu WC, Zhang L-Z (2008) Pancyclism of 3-domination-critical graphs with small minimum degree. Utilitas Math 75:175–192MATHMathSciNetGoogle Scholar
  123. 123.
    Simmons J (2005) Closure operations and hamiltonian properties of independent and total domination critical graphs. Ph.D. thesis, Department of Mathematics and Statistics, University of VictoriaGoogle Scholar
  124. 124.
    Sumner DP (1976) 1-Factors and anti-factor sets. J Lond Math Soc 13:351–359MATHMathSciNetCrossRefGoogle Scholar
  125. 125.
    Sumner DP (1990) Critical concepts in domination. Discrete Math 86:33–46MATHMathSciNetCrossRefGoogle Scholar
  126. 126.
    Sumner DP, Blitch P (1983) Domination critical graphs. J Combin Theory B 34:65–76MATHMathSciNetCrossRefGoogle Scholar
  127. 127.
    Thomassé S, Yeo A (2007) Total domination of graphs and small transverals of hypergraphs. Combinatorica 27:473–487MATHMathSciNetCrossRefGoogle Scholar
  128. 128.
    Tian F, Wei B, Zhang L (1999) Hamiltonicity in 3-domination-critical graphs with \(\alpha = \delta + 2\). Discrete Appl Math 92:57–70MATHMathSciNetCrossRefGoogle Scholar
  129. 129.
    Tian F, Xu J-M (2008) Distance domination-critical graphs. Appl Math Lett 21:416–420MathSciNetCrossRefGoogle Scholar
  130. 130.
    van der Merwe LC, Mynhardt CM, Haynes TW (1998) Total domination edge critical graphs. Utilitas Math 54:229–240MATHGoogle Scholar
  131. 131.
    van der Merwe LC, Mynhardt CM, Haynes TW (1998) Criticality index of total domination. Congr Numer 131:67–73MATHMathSciNetGoogle Scholar
  132. 132.
    van der Merwe LC, Mynhardt CM, Haynes TW (1999) 3-domination critical graphs with arbitrary independent domination numbers. Bull ICA 27:85–88MATHGoogle Scholar
  133. 133.
    van der Merwe LC, Mynhardt CM, Haynes TW (2001) Total domination edge critical graphs with maximum diameter. Discuss Math Graph Theory 21:187–205MATHMathSciNetGoogle Scholar
  134. 134.
    van der Merwe LC, Mynhardt CM, Haynes TW (2003) Total domination edge critical graphs with minimum diameter. Ars Combinatoria 66:79–96MATHMathSciNetGoogle Scholar
  135. 135.
    Vizing VG (1968) Some unsolved problems in graph theory. Uspekhi Mat Nauk 23:117–134MATHMathSciNetGoogle Scholar
  136. 136.
    Wang C, Hu Z, Li X (2009) A constructive characterization of total domination vertex critical graphs. Discrete Math 309:991–996MATHMathSciNetCrossRefGoogle Scholar
  137. 137.
    Wang T, Yu Q (2009) Factor-critical property in 3-dominating-critical graphs. Discrete Math 309:1079–1083MATHMathSciNetCrossRefGoogle Scholar
  138. 138.
    White K, Farber M, Pulleyblank W (1985) Steiner trees, connected domination and strongly chordal graphs. Networks 15:109–124MATHMathSciNetCrossRefGoogle Scholar
  139. 139.
    Wojcicka E (1990) Hamiltonian properties of domination-critical graphs. J Graph Theory 14:205–215MATHMathSciNetCrossRefGoogle Scholar
  140. 140.
    Xing H-M, Sun L, Chen X-G (2006) Domination in graphs of minimum degree five. Graph Combinator 22:127–143MATHMathSciNetCrossRefGoogle Scholar
  141. 141.
    Xue Y, Chen Z (1991) Hamiltonian cycles in domination-critical graphs. J Nanjing Univ 27:58–62MathSciNetGoogle Scholar
  142. 142.
    Yuansheng Y, Chengye Z, Xiaohui L, Yongsong J, Xin H (2005) Some 3-connected 4-edge-critical non-Hamiltonian graphs. J Graph Theory 50:316–320MATHMathSciNetCrossRefGoogle Scholar
  143. 143.
    Zhang L-Z, Tian F (2002) Independence and connectivity in 3-domination-critical graphs. Discrete Math 259:227–236MATHMathSciNetCrossRefGoogle Scholar
  144. 144.
    Zwierzchowski M (2007) Total domination number of the conjunction of graphs. Discrete Math 307:1016–1020MATHMathSciNetCrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC 2011

Authors and Affiliations

  • Nawarat Ananchuen
    • 1
  • Watcharaphong Ananchuen
  • Michael D. Plummer
  1. 1.Department of Mathematics, Faculty of ScienceSilpakorn UniversityNakorn PathomThailand

Personalised recommendations