The k-rainbow bondage number of a digraph
DOI10.7151/DMGT.1797zbMATH Open1311.05142OpenAlexW1996564943MaRDI QIDQ2344014FDOQ2344014
Authors: J. Amjadi, Negar Mohammadi, Lutz Volkmann, Seyed Mahmood 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
Recommendations
Directed graphs (digraphs), tournaments (05C20) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Coloring of graphs and hypergraphs (05C15)
Cites Work
- Title not available (Why is that?)
- On the 2-rainbow domination in graphs
- Bounds on the 2-rainbow domination number of graphs
- Rainbow domination in graphs
- The bondage number of a graph
- Rainbow domination on trees
- 2-rainbow domination of generalized Petersen graphs \(P(n,2)\)
- The \(k\)-rainbow domatic number of a graph
- The \(k\)-rainbow bondage number of a graph
- Nordhaus-Gaddum bounds on the \(k\)-rainbow domatic number of a graph
- 2-rainbow domination in generalized petersen graphs \(P(n,3)\)
- Title not available (Why is that?)
Cited In (3)
This page was built for publication: The \(k\)-rainbow bondage number of a digraph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2344014)