Abstract
A dominating set in a graph G is a set S of vertices of G such that every vertex not in S is adjacent to a vertex of S. The domination number of G is the minimum cardinality of a dominating set of G. In this paper, we survey contributions to domination theory in graphs by Teresa W. Haynes.
Original language | English |
---|---|
Pages (from-to) | 5-18 |
Number of pages | 14 |
Journal | Utilitas Mathematica |
Volume | 94 |
Publication status | Published - Jul 2014 |
Keywords
- Domination
- Domination number
ASJC Scopus subject areas
- Statistics and Probability
- Statistics, Probability and Uncertainty
- Applied Mathematics