Total domination of graphs and small transversals of hypergraphs
✍ Scribed by Stéphan Thomassé; Anders Yeo
- Publisher
- Springer-Verlag
- Year
- 2007
- Tongue
- English
- Weight
- 216 KB
- Volume
- 27
- Category
- Article
- ISSN
- 0209-9683
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
In addition to a widely studied notion of homomorphisms of graphs and hypergraphs, [2, 5 , 6, 7, 9, 13, 141, we introduce the dual notion of cohomomorphisms. We shall concentrate on only a few aapects of these mappings, mostly with regard to intended applications, [lo, 111. Our basic motivation is t
## Abstract A total dominating set, __S__, in a graph, __G__, has the property that every vertex in __G__ is adjacent to a vertex in __S__. The total dominating number, γ~__t__~(__G__) of a graph __G__ is the size of a minimum total dominating set in __G__. Let __G__ be a graph with no component of