On domination number of Cartesian product of directed cycles

DOI10.1016/j.ipl.2009.11.005zbMath1197.05111OpenAlexW2023782877MaRDI QIDQ991743

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

Publication date: 7 September 2010

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

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

zbMATH Keywords

combinatorial problemsCartesian productdomination number

Mathematics Subject Classification ID

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 (5)

Total and paired domination numbers of \(C_m\) bundles over a cycle \(C_n\) ⋮ Signed 2-independence of Cartesian product of directed paths ⋮ Domination number of Cartesian products of directed cycles ⋮ The domination number of Cartesian product of two directed paths ⋮ Domination in Digraphs

Cites Work

• On the domination number of the Cartesian product of the cycle of length \(n\) and any graph
• 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
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On domination number of Cartesian product of directed cycles