Difference between 2-rainbow domination and roman domination in graphs
From MaRDI portal
Publication:1946223
DOI10.1016/j.dam.2012.10.017zbMath1263.05071OpenAlexW2084094601MaRDI QIDQ1946223
Shinya Fujita, Michitaka Furuya
Publication date: 18 April 2013
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2012.10.017
Related Items (11)
Averaging 2-rainbow domination and Roman domination ⋮ On the k-rainbow domination in graphs with bounded tree-width ⋮ Upper bound on 3-rainbow domination in graphs with minimum degree 2 ⋮ Vertex-addition strategy for domination-like invariants ⋮ Relating 2-rainbow domination to Roman domination ⋮ Domination parameters with number 2: interrelations and algorithmic consequences ⋮ General upper bounds on independent \(k\)-rainbow domination ⋮ Bounds on weak Roman and 2-rainbow domination numbers ⋮ Roman Domination in Graphs ⋮ Rainbow Domination in Graphs ⋮ On 2-rainbow domination number of functigraph and its complement
This page was built for publication: Difference between 2-rainbow domination and roman domination in graphs
