𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Rainbow domination in the lexicographic product of graphs

✍ Scribed by Šumenjak, Tadeja Kraner; Rall, Douglas F.; Tepeh, Aleksandra

Book ID
122692798
Publisher
Elsevier Science
Year
2013
Tongue
English
Weight
410 KB
Volume
161
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Power Domination in Product Graphs
Power Domination in Product Graphs
✍ Dorbec, Paul; Mollard, Michel; Klavžar, Sandi; Špacapan, Simon 📂 Article 📅 2008 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 271 KB
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
Star-extremal graphs and the lexicograph
Star-extremal graphs and the lexicographic product
✍ Guogang Gao; Xuding Zhu 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 537 KB

The star-chromatic number and the fractional-chromatic number are two generalizations of the ordinary chromatic number of a graph. We say a graph G is star-extremal if its star-chromatic number is equal to its fractional-chromatic number. We prove that star-extremal graphs G have the following inter

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