On domination number of Cartesian product of directed paths
From MaRDI portal
Publication:411237
DOI10.1007/S10878-010-9314-XzbMATH Open1263.90116OpenAlexW1993642211MaRDI QIDQ411237FDOQ411237
Authors: Juan Liu, Xindong Zhang, Jixiang Meng 
Publication date: 4 April 2012
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-010-9314-x
Recommendations
Cites Work
- On domination numbers of Cartesian products of paths
- Title not available (Why is that?)
- Title not available (Why is that?)
- On dominating the Cartesian product of a graph and K2
- Title not available (Why is that?)
- Title not available (Why is that?)
- The domination numbers of the 5 × n and 6 × n grid graphs
- Title not available (Why is that?)
Cited In (16)
- Title not available (Why is that?)
- Signed 2-independence of Cartesian product of directed paths
- Digraphs products
- On domination numbers of Cartesian products of paths
- Domination in digraphs and their direct and Cartesian products
- Total and paired domination numbers of \(C_m\) bundles over a cycle \(C_n\)
- Domination in digraphs
- Domination parameters of strong product of directed paths
- Domination number of the cross product of paths
- On domination number of Cartesian product of directed cycles
- On the domination number of Cartesian product of two directed cycles
- Note on Split Domination Number of the Cartesian Product of Paths
- Domination number of Cartesian products of directed cycles
- The domination number of Cartesian product of two directed paths
- On total domination number of Cartesian product of directed cycles.
- Domination number of the complete directed grid graphs
This page was built for publication: On domination number of Cartesian product of directed paths
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q411237)
