Maximal 2-rainbow domination number of a graph

DOI10.1016/j.akcej.2016.06.009zbMath1348.05144OpenAlexW2474076680MaRDI QIDQ334128

Dorota Kuziak, Jafar Amjadi, Hossein Abdollahzadeh Ahangar, Seyyed Mahmoud Sheikholeslami

Publication date: 31 October 2016

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

Full work available at URL: https://doi.org/10.1016/j.akcej.2016.06.009

zbMATH Keywords

rainbow dominationmaximal dominationmaximal rainbow domination

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (3)

Further results on maximal rainbow domination number ⋮ On 2-rainbow domination number of functigraph and its complement ⋮ Total k-rainbow reinforcement number in graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The \(k\)-rainbow bondage number of a graph
• Nordhaus-Gaddum bounds on the \(k\)-rainbow domatic number of a graph
• Rainbow domination in graphs
• 2-rainbow domination in generalized petersen graphs \(P(n,3)\)
• Rainbow domination on trees
• 2-rainbow domination of generalized Petersen graphs \(P(n,2)\)
• On the 2-rainbow domination in graphs
• Defendens Imperium Romanum: A Classical Problem in Military Strategy
• The k-rainbow domatic number of a graph
• New bounds on the rainbow domination subdivision number
• A new graph product and its spectrum
• On maximal Roman domination in graphs
• The nonsplit domination number of a graph

This page was built for publication: Maximal 2-rainbow domination number of a graph