---
tag: DAAMT8VCQ5
kind: concept
name: Dominating
sources:
  - wikipedia: en:325802@r1373839425
    locator: Glossary of graph theory, section D
    note: adopted
    mention: wikipedia://en/325802#NYEW
    sections: [Summary]
inventory: [2879T5AD3W]
---

## Summary

A dominating set is a set of vertices that includes or is adjacent to every vertex in the graph; not to be confused with a vertex cover, a vertex set that is incident to all edges in the graph. Important special types of dominating sets include independent dominating sets (dominating sets that are also independent sets) and connected dominating sets (dominating sets that induced connected subgraphs). A single-vertex dominating set may also be called a universal vertex. The domination number of a graph is the number of vertices in the smallest dominating set.