Rainbow domination in the Cartesian product of directed paths

zbMATH Open1383.05237MaRDI QIDQ5374249FDOQ5374249

Authors: Guoliang Hao, Doost Ali Mojdeh, Zhihong Xie, Shou Liu Wei 

Publication date: 10 April 2018

Full work available at URL: http://ajc.maths.uq.edu.au/pdf/70/ajc_v70_p349.pdf

Recommendations

• On the rainbow domination number of digraphs
• The \(k\)-rainbow domination and domatic numbers of digraphs
• Rainbow domination in graphs
• The rainbow domination number of a digraph
• The \(k\)-rainbow bondage number of a digraph

zbMATH Keywords

\(k\)-rainbow dominating function

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Paths and cycles (05C38) Graph operations (line graphs, products, etc.) (05C76)

Cites Work

• Title not available (Why is that?)
• Bounds on the 2-rainbow domination number of graphs
• Rainbow domination in graphs
• Bounds on the domination number of a digraph
• Signed domination in regular graphs
• Rainbow domination numbers on graphs with given radius
• On the rainbow domination number of digraphs
• 2-rainbow domination number of Cartesian products: \(C_{n}\square C_{3}\) and \(C_{n}\square C_{5}\)
• The rainbow domination number of a digraph
• Bounding the paired-domination number of a tree in terms of its annihilation number
• New bounds on the signed domination numbers of graphs

Cited In (5)

• Outer independent rainbow dominating functions in graphs
• Domination in digraphs and their direct and Cartesian products
• Rainbow domination in graphs
• Rainbow domination in Cartesian product of paths and cycles
• The rainbow domination number of a digraph

This page was built for publication: Rainbow domination in the Cartesian product of directed paths

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