The \(k\)-rainbow bondage number of a digraph

DOI10.7151/DMGT.1797zbMath1311.05142OpenAlexW1996564943MaRDI QIDQ2344014

Lutz Volkmann, Negar Mohammadi, Jafar Amjadi, Seyyed Mahmoud Sheikholeslami

Publication date: 11 May 2015

Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7151/dmgt.1797

zbMATH Keywords

digraph\(k\)-rainbow bondage number\(k\)-rainbow dominating function\(k\)-rainbow domination number

Mathematics Subject Classification ID

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

Related Items (2)

Rainbow reinforcement numbers in digraphs ⋮ Rainbow Domination in Graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Bounds on the 2-rainbow domination number of graphs
• 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)\)
• The bondage number of a graph
• On the 2-rainbow domination in graphs
• The k-rainbow domatic number of a graph

This page was built for publication: The \(k\)-rainbow bondage number of a digraph