𝔖 Bobbio Scriptorium
✦   LIBER   ✦

2-Rainbow domination number of

✍ Scribed by Stȩpień, Zofia; Szymaszkiewicz, Alicja; Szymaszkiewicz, Lucjan; Zwierzchowski, Maciej

Book ID
122118395
Publisher
Elsevier Science
Year
2014
Tongue
English
Weight
357 KB
Volume
170
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On rainbow domination numbers of graphs
On rainbow domination numbers of graphs
✍ Shao, Zehui; Liang, Meilian; Yin, Chuang; Xu, Xiaodong; Pavlič, Polona; Žerovnik 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 459 KB
Note on 2-rainbow domination and Roman d
Note on 2-rainbow domination and Roman domination in graphs
✍ Yunjian Wu; Huaming Xing 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 244 KB

A Roman dominating function of a graph G is a function f : V → {0, 1, 2} such that every vertex with 0 has a neighbor with 2. The minimum of f (V (G)) = v∈V f (v) over all such functions is called the Roman domination number γ R (G). A 2-rainbow dominating function of a graph G is a function g that

Rainbow connection number and connected
Rainbow connection number and connected dominating sets
✍ L. Sunil Chandran; Anita Das; Deepak Rajendraprasad; Nithin M. Varma 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 167 KB

## Abstract The __rainbow connection number__ of a connected graph is the minimum number of colors needed to color its edges, so that every pair of its vertices is connected by at least one path in which no two edges are colored the same. In this article we show that for every connected graph on __