# domination number

## English[edit]

### Noun[edit]

- (graph theory) the number of vertices in a minimum dominating set of a given graph, often denoted as

Definition from Wiktionary, the free dictionary

Jump to: navigation, search

- (graph theory) the number of vertices in a minimum dominating set of a given graph, often denoted as $\gamma =\gamma (G)$

- Not logged in
- Talk
- Contributions
- Create account
- Log in

- This page was last edited on 15 November 2016, at 17:01.
- Text is available under the Creative Commons Attribution-ShareAlike License; additional terms may apply. By using this site, you agree to the Terms of Use and Privacy Policy.