Skip to main content

Glossary of Common Terms

  • Chapter
  • First Online:
Topics in Domination in Graphs

Part of the book series: Developments in Mathematics ((DEVM,volume 64))

  • 747 Accesses

Abstract

This glossary contains the most common terms and parameters of graphs that appear in this book. We include these in this introductory chapter so that they need not be re-defined over and over again in each subsequent chapter.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 44.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 59.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 59.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. W. Ahrens, Mathematische Unterhaltungen und Spiele. Druck und Verlag von B. G. Teubner, Leipzig-Berlin, (1910), 311–312.

    Google Scholar 

  2. W. W. Rouse Ball, Mathematical Recreations and Essays, Fourth Edition, Macmillan, 1905.

    Google Scholar 

  3. C. Berge, The Theory of Graphs and its Applications. Methuen, London, 1962.

    MATH  Google Scholar 

  4. M. Bezzel, Schachfreund. Berliner Schachzeitung 3 (1848), 363.

    Google Scholar 

  5. A. Brandstädt, V. B. Le and J. P. Spinrad, Graph Classes: A Survey, SIAM Monographs on Discrete Mathematics and Applications, SIAM, Philadelphia, PA, 1999.

    Book  Google Scholar 

  6. E.J. Cockayne and S.T. Hedetniemi, Towards a theory of domination in graphs. Networks 7 (1977), 247–261.

    Article  MathSciNet  Google Scholar 

  7. C. F. de Jaenisch, Applications de l’Analyse Mathematique au Jeu des Echecs. Petrograd, 1862.

    Google Scholar 

  8. H. E. Dudeney, The Canterbury Puzzles and Other Curious Problems. E. P. Dutton and Company, New York, 1908.

    Google Scholar 

  9. R. Gera, T. W. Haynes, S. T. Hedetniemi and M. A. Henning, An Annotated Glossary of Graph Theory Parameters with Conjectures in Graph Theory, Favorite Conjectures and Open Problems, Volume 2, R. Gera, T. W. Haynes and S. T. Hedetniemi, editors. Springer, 2018, pages 177–281.

    Google Scholar 

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

    MATH  Google Scholar 

  11. T. W. Haynes, S. T. Hedetniemi and P. J. Slater, Domination in Graphs, Advanced Topics, Marcel Dekker, New York, 1998.

    MATH  Google Scholar 

  12. M. A. Henning and A. Yeo, Total Domination in Graphs (Springer Monographs in Mathematics). Springer New York (2013). ISBN: 978-1-4614-6524-9 (Print) 978-1-4614-6525-6 (eBook).

    Google Scholar 

  13. D. König, Theorie der Endlichen und Unendlichen Graphen, Akademische Verlagsgesellschaft M. B. H., Leipzig, 1936, later Chelsea, New York, 1950.

    Google Scholar 

  14. F. Nauck, Briefwechsel mit allen für alle, Illustrirte Zeitung 15 (1850), 182.

    Google Scholar 

  15. O. Ore, Theory of Graphs, Amer. Math. Soc. Colloq. Publ., Vol 38, Amer. Math. Soc., Providence, RI, 1962.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Teresa W. Haynes .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Switzerland AG

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Haynes, T.W., Hedetniemi, S.T., Henning, M.A. (2020). Glossary of Common Terms. In: Haynes, T.W., Hedetniemi, S.T., Henning, M.A. (eds) Topics in Domination in Graphs. Developments in Mathematics, vol 64. Springer, Cham. https://doi.org/10.1007/978-3-030-51117-3_1

Download citation

Publish with us

Policies and ethics