Abstract
We prove a conjecture of Favaron et al. that every graph of order n and minimum degree at least three has a total dominating set of size at least n/2.
We also present several related results about: (1) extentions to graphs
of minimum degree two, (2) examining graphs where the bound is tight,
and (3) a type of bipartite domination and its relation to transversals
in hypergraphs.
| Original language | English |
|---|---|
| Pages (from-to) | 207-210 |
| Number of pages | 4 |
| Journal | Journal of Graph Theory |
| Volume | 46 |
| Issue number | 3 |
| Early online date | 7 Apr 2004 |
| DOIs | |
| Publication status | Published - Jul 2004 |
| Externally published | Yes |
User-Defined Keywords
- Bipartite domination
- Total domination
- Transversals in hypergraphs
Fingerprint
Dive into the research topics of 'Some remarks on domination'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver