General bounds on rainbow domination numbers

DOI10.1007/S00373-013-1394-9zbMath1312.05105OpenAlexW1976768565MaRDI QIDQ2345524

Colton Magnant, Michitaka Furuya, Shinya Fujita

Publication date: 22 May 2015

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-013-1394-9

zbMATH Keywords

minimum degree\(k\)-rainbow dominating functionrainbow domination number

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Vertex degrees (05C07)

Related Items (8)

Rainbow domination numbers on graphs with given radius ⋮ Upper bound on 3-rainbow domination in graphs with minimum degree 2 ⋮ Rainbow domination numbers of generalized Petersen graphs ⋮ General upper bounds on independent \(k\)-rainbow domination ⋮ The \(k\)-rainbow reinforcement numbers in graphs ⋮ Rainbow Domination in Graphs ⋮ On \(k\)-rainbow domination in regular graphs ⋮ The restrained k-rainbow reinforcement number of graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Bounds on the 2-rainbow domination number of graphs
• A note on the k-domination number of a graph
• Rainbow domination in graphs
• Rainbow domination on trees
• Domination in graphs with minimum degree two
• An upper bound for domination number of 5-regular graphs
• Paths, Stars and the Number Three

This page was built for publication: General bounds on rainbow domination numbers