Abstract
As we have seen in Chapter 1, domination in graphs has roots in many sources, including defense strategies, games such as chess, computer communication networks, and network surveillance and security. In this chapter, we discuss the graph theoretical core concepts of domination and equivalent definitions for the domination number, thereby setting the foundation for the remaining chapters in the book. In order to explain the core concepts in domination in graphs, we need only a few definitions, which are given in the glossary in Appendix A and in Chapter 1.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2023 Springer Nature Switzerland AG
About this chapter
Cite this chapter
Haynes, T.W., Hedetniemi, S.T., Henning, M.A. (2023). Fundamentals of Domination. In: Domination in Graphs: Core Concepts. Springer Monographs in Mathematics. Springer, Cham. https://doi.org/10.1007/978-3-031-09496-5_2
Download citation
DOI: https://doi.org/10.1007/978-3-031-09496-5_2
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-09495-8
Online ISBN: 978-3-031-09496-5
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)