The total {k}-domatic number of a graph
β Scribed by S. M. Sheikholeslami; L. Volkmann
- Publisher
- Springer US
- Year
- 2010
- Tongue
- English
- Weight
- 355 KB
- Volume
- 23
- Category
- Article
- ISSN
- 1382-6905
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
A Roman dominating function on a graph G is a labeling f : V (G) -β {0, 1, 2} such that every vertex with label 0 has a neighbor with label 2. A set { f 1 , f 2 , . . . , f d } of Roman dominating functions on G with the property that called a Roman dominating family (of functions) on G. The maximu
For a positive integer k, a k-rainbow dominating function of a graph G is a function f from the vertex set V (G) to the set of all subsets of the set {1, 2, . . . , k} such that for any vertex rainbow dominating family (of functions) on G. The maximum number of functions in a k-rainbow dominating f