Skip to main content
SpringerLink
Log in

Pairs of Disjoint Dominating Sets in Connected Cubic Graphs

  • Original Paper
  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

Abstract

For a connected cubic graph G of order n, we prove the existence of two disjoint dominating sets D 1 and D 2 with \({|D_1|+|D_2|\leq \frac{157}{198}n+\frac{8}{9}}\).

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Blank M.: An estimate of the external stability number of a graph without suspended vertices. Prikl. Math. Programm. 10, 3–11 (1973)

    MathSciNet  Google Scholar 

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

    MathSciNet  MATH  Google Scholar 

  3. Domke G.S., Dunbar J.E., Markus L.R.: The inverse domination number of a graph. Ars Comb. 72, 149–160 (2004)

    MathSciNet  MATH  Google Scholar 

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

    Article  Google Scholar 

  5. Frendrup A., Henning M.A., Randerath B., Vestergaard P.D.: On a conjecture about inverse domination in graphs. Ars Combin. 97A, 129–143 (2010)

    MathSciNet  MATH  Google Scholar 

  6. Haynes T.W., Hedetniemi S.T., Slater P.J.: Fundamentals of domination in graphs. Marcel Dekker, New York (1998)

    MATH  Google Scholar 

  7. Haynes, T.W., Hedetniemi, S.T., Slater, P.J. (eds.): Domination in graphs: Advanced topics, Marcel Dekker, New York (1998)

  8. Hedetniemi, S.M., Hedetniemi, S.T., Laskar, R.C., Markus, L., Slater, P.J.: Disjoint dominating sets in graphs, In: Proceedings of the International Conference on Discrete Mathematics. Ramanujan Mathematics Society Lecture Notes Series 7, 87–100 (2008)

  9. Henning M.A., Löwenstein C., Rautenbach D.: Remarks about disjoint dominating sets. Discrete Math. 309, 6451–6458 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  10. Kawarabayashi K., Plummer M.D., Saito A.: Domination in a graph with a 2-factor. J. Graph Theory 52, 1–6 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  11. Kostochka A.V., Stodolsky B.Y.: On domination in connected cubic graphs. Discrete Math. 304, 45–50 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  12. Kostochka A.V., Stodolsky B.Y.: An upper bound on the domination number of n-vertex connected cubic graphs. Discrete Math. 309, 1142–1162 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  13. Král, D., Škoda, P., Volec, J.: Domination number of cubic graphs with large girth, manuscript (2009)

  14. Kulli V.R., Sigarkanti S.C.: Inverse domination in graphs. Nat. Acad. Sci. Lett. 14, 473–475 (1991)

    MathSciNet  MATH  Google Scholar 

  15. Löwenstein C., Rautenbach D.: Domination in graphs of minimum degree at least two and large girth. Graphs Comb. 24, 37–46 (2008)

    Article  MATH  Google Scholar 

  16. Löwenstein C., Rautenbach D.: Pairs of disjoint dominating sets and the minimum degree of graphs. Graphs Comb. 26, 407–424 (2010)

    Article  MATH  Google Scholar 

  17. McCuaig W., Shepherd B.: Domination in graphs with minimum degree two. J. Graph Theory 13, 749–762 (1989)

    Article  MathSciNet  MATH  Google Scholar 

  18. Ore, O.: Theory of graphs, American Mathematical Society Colloquium Publications 38 (Amer. Math. Soc., Providence, RI), pp. 206–212 (1962)

  19. Rautenbach, D., Reed, B.: Domination in cubic graphs of large girth, in: Proc. CGGT 2007, LNCS vol. 4535, 186–190 (2008)

  20. Reed B.: Paths, stars and the number three. Combin. Prob. Comput. 5, 277–295 (1996)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, University of Johannesburg, Auckland Park, 2006, South Africa

    Christian Löwenstein

  2. Institut für Optimierung und Operations Research, Universität Ulm, Ulm, Germany

    Dieter Rautenbach

Authors
  1. Christian Löwenstein
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Dieter Rautenbach
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Christian Löwenstein.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Löwenstein, C., Rautenbach, D. Pairs of Disjoint Dominating Sets in Connected Cubic Graphs. Graphs and Combinatorics 28, 407–421 (2012). https://doi.org/10.1007/s00373-011-1050-1

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00373-011-1050-1

Keywords

Mathematics Subject Classification (2010)

Search

Navigation