The domination number of strong product of directed cycles
DOI10.1142/S1793830914500219zbMATH Open1310.05157OpenAlexW2026775156MaRDI QIDQ2875686FDOQ2875686
Authors: Huiping Cai, Juan Liu, Lingzhi Qian 
Publication date: 11 August 2014
Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s1793830914500219
Recommendations
- On domination number of Cartesian product of directed cycles
- Total domination number of strong products of directed cycles
- Domination number of Cartesian products of directed cycles
- On the domination number of Cartesian product of two directed cycles
- On the domination of Cartesian product of directed cycles: results for certain equivalence classes of lengths
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
Cited In (8)
- Title not available (Why is that?)
- Fractional domination of strong direct products
- Total domination number of products of two directed cycles
- Domination in Digraphs
- Dominating Cartesian products of cycles
- A simple proof of the multiplicativity of directed cycles of prime power length
- On total domination number of Cartesian product of directed cycles.
- Title not available (Why is that?)
This page was built for publication: The domination number of strong product of directed cycles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2875686)
