#### Filter Results:

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

A set S V is a dominating set of a graph G = (V; E) if each vertex in V is either in S or is adjacent to a vertex in S. A vertex is said to dominate itself and all its neighbors. The domination number (G) is the minimum cardinality of a dominating set of G. A set S V is an independent set of vertices if no two vertices in S are adjacent. The independence… (More)

- ‹
- 1
- ›