General upper bounds on independent \(k\)-rainbow domination

DOI10.1016/j.dam.2018.11.018zbMath1407.05177OpenAlexW2905052894MaRDI QIDQ1732101

Shinya Fujita, Colton Magnant, Michitaka Furuya

Publication date: 22 March 2019

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2018.11.018

zbMATH Keywords

bipartite graphrainbow dominationindependent rainbow domination

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (2)

A sharp upper bound on the independent 2-rainbow domination in graphs with minimum degree at least two ⋮ Rainbow Domination in Graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Bounds on the 2-rainbow domination number of graphs
• Some results on Vizing's conjecture and related problems
• Strong equality between the 2-rainbow domination and independent 2-rainbow domination numbers in trees
• Bounds on weak Roman and 2-rainbow domination numbers
• Rainbow domination in graphs
• Note on 2-rainbow domination and Roman domination in graphs
• Two relations between the parameters of independence and irredundance
• Independent domination in graphs: A survey and recent results
• Difference between 2-rainbow domination and roman domination in graphs
• A note on total domination and 2-rainbow domination in graphs
• General bounds on rainbow domination numbers
• Independent 2-rainbow domination in trees

This page was built for publication: General upper bounds on independent \(k\)-rainbow domination