𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Difference between -rainbow domination and Roman domination in graphs

✍ Scribed by Fujita, Shinya; Furuya, Michitaka

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

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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

Signed Roman domination in graphs
Signed Roman domination in graphs
✍ Abdollahzadeh Ahangar, H.; Henning, Michael A.; Lâwenstein, Christian; Zhao, Ya πŸ“‚ Article πŸ“… 2012 πŸ› Springer US 🌐 English βš– 531 KB
Roman Domination on 2-Connected Graphs
Roman Domination on 2-Connected Graphs
✍ Liu, Chun-Hung; Chang, Gerard J. πŸ“‚ Article πŸ“… 2012 πŸ› Society for Industrial and Applied Mathematics 🌐 English βš– 233 KB
Generalized domination and efficient dom
Generalized domination and efficient domination in graphs
✍ D.W. Bange; A.E. Barkauskas; L.H. Host; P.J. Slater πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 516 KB

This paper generalizes dominating and efficient dominating sets of a graph. Let G be a graph with vertex set V(G). If f: V(G) ~ Y, where Y is a subset of the reals, the weight off is the sum of f(v) over all ve V(G). If the closed neighborhood sum off(v) at every vertex is at least 1, thenfis called

Signed Roman edge domination numbers in
Signed Roman edge domination numbers in graphs
✍ Ahangar, H. Abdollahzadeh; Amjadi, J.; Sheikholeslami, S. M.; Volkmann, L.; Zhao πŸ“‚ Article πŸ“… 2014 πŸ› Springer US 🌐 English βš– 209 KB