The k-rainbow domatic number of a graph

DOI10.7151/DMGT.1591zbMATH Open1255.05139OpenAlexW2017796724MaRDI QIDQ2906372FDOQ2906372

Authors: Lutz Volkmann, Seyed Mahmood Sheikholeslami 

Publication date: 5 September 2012

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

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

Recommendations

• \(k\)-rainbow domatic numbers
• The \(k\)-rainbow domination and domatic numbers of digraphs
• Nordhaus-Gaddum bounds on the \(k\)-rainbow domatic number of a graph
• General bounds on rainbow domination numbers
• Total \(k\)-rainbow domination numbers in graphs

zbMATH Keywords

\(k\)-rainbow dominating function\(k\)-rainbow domination number\(k\)-rainbow domatic number

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cited In (30)

• Unicyclic graphs with strong equality between the 2-rainbow domination and independent 2-rainbow domination numbers
• A sharp upper bound on the independent 2-rainbow domination in graphs with minimum degree at least two
• Title not available (Why is that?)
• Trees with equal total domination and 2-rainbow domination numbers
• On the outer independent 2-rainbow domination number of Cartesian products of paths and cycles
• Total k-rainbow reinforcement number in graphs
• Restrained k-rainbow reinforcement number in graphs
• General upper bounds on independent \(k\)-rainbow domination
• Global rainbow domination in graphs
• \(k\)-rainbow domatic numbers
• Strong equality between the 2-rainbow domination and independent 2-rainbow domination numbers in trees
• On \(k\)-rainbow domination in middle graphs
• The \(k\)-rainbow bondage number of a digraph
• Mixed \(k\)-rainbow domination numbers in graphs
• Independent 2-rainbow domination in trees
• Graphs with large total 2-rainbow domination number
• Maximal 2-rainbow domination number of a graph
• The \(k\)-rainbow bondage number of a graph
• Rainbow reinforcement numbers in digraphs
• Nordhaus-Gaddum bounds on the \(k\)-rainbow domatic number of a graph
• Domination-related parameters in middle graphs
• General bounds on rainbow domination numbers
• On \(k\)-rainbow domination in regular graphs
• The \(l\)-distance \(k\)-rainbow domination numbers of graphs
• Rainbow domination in graphs
• Upper bound on 3-rainbow domination in graphs with minimum degree 2
• On 2-rainbow domination of generalized Petersen graphs
• The \(k\)-rainbow reinforcement numbers in graphs
• The \(k\)-rainbow domination and domatic numbers of digraphs
• Total \(k\)-rainbow domination numbers in graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2906372)