Abstract
It is well-known that the total domination number γt(G) of a graph G without isolated vertices is at most twice its domination number γ(G). We provide a constructive characterization of trees T satisfying γt(T) = 2γ(T).
Original language | English |
---|---|
Pages (from-to) | 99-106 |
Number of pages | 8 |
Journal | Utilitas Mathematica |
Volume | 60 |
Publication status | Published - Nov 2001 |
Externally published | Yes |
ASJC Scopus subject areas
- Statistics and Probability
- Statistics, Probability and Uncertainty
- Applied Mathematics