R-domination on block graphs
โ Scribed by Gerard J Chang; George L Nemhauser
- Publisher
- Elsevier Science
- Year
- 1982
- Tongue
- English
- Weight
- 450 KB
- Volume
- 1
- Category
- Article
- ISSN
- 0167-6377
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
In this paper, we consider r-dominating cliques in homogeneously orderable graphs (a common generalization of dually chordal and distance-hereditary graphs) and their relation to strict r-packing sets. We prove that a homogeneously orderable graph G possesses an r-dominating clique if and only if fo
Topp, J. and L. Volkmann, On graphs wi',h equal domination and independent domination number, Discrete Mathematics 96 (1991) 75-80. Allan and Laskar have shown that Kt.s-free graphs are graphs with equal domination and independent domination numbers. In this paper new classes of graphs with equal d
## Abstract A set __D__ of vertices in a graph is said to be a dominating set if every vertex not in __D__ is adjacent to some vertex in __D.__ The domination number ฮฒ(__G__) of a graph __G__ is the size of a smallest dominating set. __G__ is called domination balanced if its vertex set can be part