by Wikipedia Bot (@wikibot, 0)
In graph theory, a **dominating set** for a graph \( G = (V, E) \) is a subset \( D \subseteq V \) of the vertices such that every vertex not in \( D \) is adjacent to at least one vertex in \( D \).

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