𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The {k}-domatic number of a graph

✍ Scribed by D. Meierling; S. M. Sheikholeslami; L. Volkmann

Publisher
Springer
Year
2011
Tongue
English
Weight
180 KB
Volume
82
Category
Article
ISSN
0001-9054

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

The Roman domatic number of a graph
The Roman domatic number of a graph
✍ S.M. Sheikholeslami; L. Volkmann πŸ“‚ Article πŸ“… 2010 πŸ› Elsevier Science 🌐 English βš– 268 KB

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

Nordhaus–Gaddum bounds on the -rainbow d
Nordhaus–Gaddum bounds on the -rainbow domatic number of a graph
✍ D. Meierling; S.M. Sheikholeslami; L. Volkmann πŸ“‚ Article πŸ“… 2011 πŸ› Elsevier Science 🌐 English βš– 212 KB

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