𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Nordhaus–Gaddum-Type Theorem for Rainbow Connection Number of Graphs

✍ Scribed by Lily Chen, Xueliang Li, Huishu Lian

Book ID
120788726
Publisher
Springer Japan
Year
2012
Tongue
English
Weight
519 KB
Volume
29
Category
Article
ISSN
0911-0119

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