1 |
Models of Domination in GraphsHaynes, Teresa W., Hedetniemi, Stephen T., Henning, Michael A. 01 January 2020 (has links)
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.
|
Page generated in 0.1109 seconds