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.
| Identifer | oai:union.ndltd.org:ETSU/oai:dc.etsu.edu:etsu-works-10350 |
| Date | 01 January 2020 |
| Creators | Haynes, Teresa W., Hedetniemi, Stephen T., Henning, Michael A. |
| Publisher | Digital Commons @ East Tennessee State University |
| Source Sets | East Tennessee State University |
| Detected Language | English |
| Type | text |
| Source | ETSU Faculty Works |
Page generated in 0.0017 seconds