Skip to main content
SpringerLink
Log in

Pioneer of Domination in Graphs

  • Chapter
  • First Online:
From Domination to Coloring

Part of the book series: SpringerBriefs in Mathematics ((BRIEFSMATH))

  • 491 Accesses

Abstract

Stephen Hedetniemi is perhaps best known for his pioneering work in domination in graphs. In this chapter, we explore some of his contributions to the direction and advancement of this field of study. We focus on two topics, namely domination of chessboard graphs and the domination chain.

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

Access this chapter

Log in via an institution
eBook
USD 16.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 16.99
Price excludes VAT (USA)
  • Compact, lightweight 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. S. Arumugam, S.T. Hedetniemi, S.M. Hedetniemi, L. Sathikala, S. Sudha, The covering chain of a graph. Util. Math. 98, 183–196 (2015)

    MathSciNet  MATH  Google Scholar 

  2. W.W. Rouse Ball, Mathematical Recreations and Essays, revision by H.S.M. Coxeter of the original 1892; Minimum Pieces Problem, 3rd edn. (Macmillan, London, 1939)

    Google Scholar 

  3. C. Berge, Theory of Graphs and Its Applications (Methuen, London, 1962)

    MATH  Google Scholar 

  4. W. Bird, Computational Methods for Domination Problems. Doctoral Dissertation, University of Victoria, 2017

    Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  6. S. Bozóki, P. Gál, I. Marosi W.D. Weakley, Domination of the rectangular queens graph, submitted

    Google Scholar 

  7. M. Chellali, T.W. Haynes, S.M. Hedetniemi, S.T. Hedetniemi, A. McRae, A Roman domination chain. Graphs Comb. 32, 79–92 (2016)

    Article  MathSciNet  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  9. E.J. Cockayne, O. Favaron, C. Payan, A. Thomason, Contributions to the theory of domination, independence, and irredundance in graphs. Discret. Math. 33, 249–258 (1981)

    Article  MathSciNet  Google Scholar 

  10. E.J. Cockayne, J.H. Hattingh, S.M. Hedetniemi, S.T. Hedetniemi, A.A. McRae, Using maximality and minimality conditions to construct inequality chains. Discret. Math. 176, 43–61 (1997)

    Article  MathSciNet  Google Scholar 

  11. E.J. Cockayne, S.T. Hedetniemi, On the diagonal queens domination problem. J. Comb. Theory Ser. A 42, 137–139 (1986)

    Article  MathSciNet  Google Scholar 

  12. E.J. Cockayne, S.T. Hedetniemi, D.J. Miller, Properties of hereditary hypergraphs and middle graphs. Canad. Math. Bull. 21, 461–468 (1978)

    Article  MathSciNet  Google Scholar 

  13. C.F. De Jaenisch, Applications de I’Analyse Mathematique an Jeu des Echecs (Petrograd, 1863)

    Google Scholar 

  14. D. Finozhenok, W.D. Weakley, An improved lower bound for domination numbers of the queen’s graph. Australas. J. Comb. 37, 295–300 (2007)

    MathSciNet  MATH  Google Scholar 

  15. G.H. Fricke, S.M. Hedetniemi, S.T. Hedetniemi, A. McRae, C.K. Wallis, M.S. Jacobson, H.W. Martin, W.D. Weakley, Combinatorial problems on chessboards: a brief survey. Graph Theory, Combinatorics, and Algorithms, vol. 1, 2 (Kalamazoo, 1992), pp. 507–528; (Wiley-Interscience Publication, Wiley, New York, 1995)

    Google Scholar 

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

    MATH  Google Scholar 

  17. S.M. Hedetniemi, S.T. Hedetniemi, R. Reynolds, Combinatorial problems on chessboards. II, Domination in Graphs, Monographs and Textbooks in Pure and Applied Mathematics, vol. 209 (Dekker, New York, 1998), pp. 133–162

    Google Scholar 

  18. S.T. Hedetniemi, My top 10 graph theory conjectures and open problems, in Graph Theory, Favorite Conjectures and Open Problems, Volume 1, ed. by R. Gera, S.T. Hedetniemi, C. Larson (Springer, Berlin, 2018), pp. 177–281

    Google Scholar 

  19. D. König, Theorie der endlichen und unendlichen graphen (Akademische Verlagsgesellschaft M.B.H. Leipzig, 1936) and (Chelsea Publishing, New York, 1950)

    Google Scholar 

  20. P.R.J. Östergård, W.D. Weakley, Values of domination numbers of the queen’s graph. Electron. J. Comb. 8 (2001), Research Paper 29, 19 pp

    Google Scholar 

  21. A. Sinko, P.J. Slater, Queens domination using border squares and (A, B)-restricted domination. Discret. Math. 308, 4822–4828 (2008)

    Google Scholar 

  22. W.D. Weakley, A lower bound for domination numbers of the queen’s graph. J. Comb. Math. Comb. Comput. 43, 231–254 (2002)

    MathSciNet  MATH  Google Scholar 

  23. W.D. Weakley, Upper bounds for domination numbers of the queen’s graph. Discret. Math. 242, 229–243 (2002)

    Article  MathSciNet  Google Scholar 

  24. W.D. Weakley, Domination in the queen’s graph, Graph Theory, Combinatorics, and Algorithms, vol. 1, 2 (Kalamazoo, 1992), pp. 1223–1232; (Wiley-Interscience Publication, Wiley, New York, 1995)

    Google Scholar 

  25. W.D. Weakley, Queens around the world in twenty-five years, in Graph Theory, Favorite Conjectures and Open Problems, Volume 2, ed. by R. Gera, T.W. Haynes, S.T. Hedetniemi (Springer, Berlin, 2018), pp. 43–54

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, Western Michigan University, Kalamazoo, MI, USA

    Gary Chartrand & Ping Zhang

  2. Department of Mathematics, East Tennessee State University, Johnson City, TN, USA

    Teresa W. Haynes

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

    Michael A. Henning

Authors
  1. Gary Chartrand
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Teresa W. Haynes
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Michael A. Henning
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Ping Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Gary Chartrand .

Rights and permissions

Reprints and permissions

Copyright information

© 2019 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Chartrand, G., Haynes, T.W., Henning, M.A., Zhang, P. (2019). Pioneer of Domination in Graphs. In: From Domination to Coloring. SpringerBriefs in Mathematics. Springer, Cham. https://doi.org/10.1007/978-3-030-31110-0_1

Download citation

Publish with us

Policies and ethics

Search

Navigation