Models of Domination in Graphs
A set S of vertices in a graph G is a dominating set if every vertex not in S is adjacent to at least one vertex in S. In this chapter, we present logical models called frameworks, each of which gives a different perspective of dominating sets.
Haynes, Teresa W.; Hedetniemi, Stephen T.; and Henning, Michael A.. 2020. Models of Domination in Graphs. Developments in Mathematics. Vol.64 13-30. https://doi.org/10.1007/978-3-030-51117-3_2 ISSN: 1389-2177