Domination number of Cartesian products of directed cycles

DOI10.1016/j.ipl.2010.10.001zbMath1259.05134OpenAlexW1994365837MaRDI QIDQ1944032

Xindong Zhang, Xing Chen, Juan Liu, Ji Xiang Meng

Publication date: 4 April 2013

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2010.10.001

zbMATH Keywords

combinatorial problemsCartesian productdomination numberefficient dominating set

Mathematics Subject Classification ID

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

Related Items (6)

Dominating problems in swapped networks ⋮ Total and paired domination numbers of \(C_m\) bundles over a cycle \(C_n\) ⋮ Signed 2-independence of Cartesian product of directed paths ⋮ The domination number of Cartesian product of two directed paths ⋮ Feedback arc number and feedback vertex number of Cartesian product of directed cycles ⋮ Domination in Digraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the domination number of the Cartesian product of the cycle of length \(n\) and any graph
• On domination number of Cartesian product of directed cycles
• On domination numbers of Cartesian products of paths
• Dominating Cartesian products of cycles
• On dominating the Cartesian product of a graph and K₂
• The domination numbers of the 5 × n and 6 × n grid graphs

This page was built for publication: Domination number of Cartesian products of directed cycles