Global dominating set
Summary
In graph theory, a global dominating set is a dominating set of a graph that is also a dominating set of the complement graph . The global domination number is the minimum cardinality of a global dominating set of . The concept was introduced by E. Sampathkumar in 1989.
Further reading
- Wikipedia, page 81850321, revision 1337922711, Global dominating set. adopted
About this page
| Tag | DGM1FPKVWX |
|---|---|
| URI | m2://DGM1FPKVWX |
| Kind | concept |
| Writing | W1 stated |
| Same as | |
| Changed | 4 November 2026 |
Markdown · JSON · Edit on GitHub
What this page needs for W2
- edge defines in: at least one definition (0 of 1)
- edge instance_of in: at least two examples (0 of 2)
- edge not_instance_of in: at least one non-example (0 of 1)
- edge specializes both: the more general notions and the special cases (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
What links here
No page links to this page yet.