# DOMINATION IN GRAPHS OF MINIMUM DEGREE FOUR

• Sohn, Moo-Young ;
• Xudong, Yuan
• Published : 2009.07.01
• 69 12

#### Abstract

A dominating set for a graph G is a set D of vertices of G such that every vertex of G not in D is adjacent to a vertex of D. Reed [11] considered the domination problem for graphs with minimum degree at least three. He showed that any graph G of minimum degree at least three contains a dominating set D of size at most $\frac{3}{8}$ |V (G)| by introducing a covering by vertex disjoint paths. In this paper, by using this technique, we show that every graph on n vertices of minimum degree at least four contains a dominating set D of size at most $\frac{4}{11}$ |V (G)|.

#### Keywords

graphs;domination number

#### References

1. N. Alon and J. H. Spencer, The Probabilistic Method, Wiley-Interscience, New York, 1992
2. Y. Caro and Y. Roditty, On the vertex-independence number and star decomposition of graphs, Ars Combin. 20 (1985), 167–180
3. Y. Caro and Y. Roditty, A note on the k-domination number of a graph, Internat. J. Math. Math. Sci. 13 (1990), no. 1, 205–206 https://doi.org/10.1155/S016117129000031X
4. G. Chartrand and L. Lesniak, Graphs and Digraphs, 3rd Edition, Chapman and Hall, London, 1996
5. T. W. Haynes, S. T. Hedetniemi, and P. J. Slater, Fundamentals of Domination in Graphs, Marcel Dekker, Inc., New York, 1998
6. T. W. Haynes, S. T. Hedetniemi, and P. J. Slater, Domination in Graphs, Marcel Dekker, Inc., New York, 1998
7. W. McCuaig and B. Shepherd, Domination in graphs with minimum degree two, J. Graph Theory 13 (1989), no. 6, 749–762 https://doi.org/10.1002/jgt.3190130610
8. O. Ore, Theory of Graphs, American Mathematical Society Colloquium Publications, Vol. XXXVIII, American Mathematical Society, Providence, R.I. 1962
9. B. A. Reed, Paths, stars and the number three, Combin. Probab. Comput. 5 (1996), no. 3, 277–295 https://doi.org/10.1017/S0963548300002042
10. B. A. Reed, Paths, stars and the number three: the grunge, University of Waterloo, Technical Report, 1993
11. M. R. Garey and D. S. Johnson, Computers and intractability, A guide to the theory of NP-completeness. A Series of Books in the Mathematical Sciences. W. H. Freeman and Co., San Francisco, Calif., 1979
12. C. Payan and N. H. Xuong, Domination-balanced graphs, J. Graph Theory 6 (1982), no. 1, 23–32 https://doi.org/10.1002/jgt.3190060104
13. L. A. Sanchis, Bounds related to domination in graphs with minimum degree two, J. Graph Theory 25 (1997), no. 2, 139–152 https://doi.org/10.1002/(SICI)1097-0118(199706)25:2<139::AID-JGT6>3.0.CO;2-N

#### Cited by

1. Improved Upper Bounds on the Domination Number of Graphs With Minimum Degree at Least Five vol.32, pp.2, 2016, https://doi.org/10.1007/s00373-015-1585-7
2. On the Structure of Dominating Graphs vol.33, pp.4, 2017, https://doi.org/10.1007/s00373-017-1792-5
3. On dominating sets of maximal outerplanar and planar graphs vol.198, 2016, https://doi.org/10.1016/j.dam.2015.06.024
4. Dominating plane triangulations vol.211, 2016, https://doi.org/10.1016/j.dam.2016.04.011
5. Dominating sets in plane triangulations vol.310, pp.17-18, 2010, https://doi.org/10.1016/j.disc.2010.03.022