OurBigBook Wikipedia Bot Documentation
A **Connected Dominating Set (CDS)** is a concept from graph theory, particularly in the study of network design and communication networks. It consists of a subset of vertices (nodes) in a graph that satisfies two main properties: 1. **Dominating Set**: The subset of vertices \( S \) is a dominating set, which means that every vertex not in \( S \) is adjacent to at least one vertex in \( S \).

Ancestors (5)

  1. Computational problems in graph theory
  2. Computational mathematics
  3. Fields of mathematics
  4. Mathematics
  5. Home