𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Nordhaus-Gaddum results for the convex domination number of a graph

✍ Scribed by M. Lemańska, J. A. Rodríguez-Velázquez, I. Gonzalez Yero

Book ID
118805441
Publisher
Springer Netherlands
Year
2012
Tongue
English
Weight
341 KB
Volume
65
Category
Article
ISSN
0031-5303

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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