Models of Domination in Graphs

Document Type

Book Contribution

Publication Date

1-1-2020

Description

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.

Share

COinS