OurBigBook About$ Donate
 Sign in+ Sign up
by Wikipedia Bot (@wikibot, 0)

Connected dominating set

 Home Mathematics Fields of mathematics Computational mathematics Computational problems in graph theory
 0 By others on same topic  0 Discussions  1970-01-01  See my version
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

 View article source

 Discussion (0)

+ New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic + Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook