The domination number of Cartesian product of two directed paths
From MaRDI portal
Publication:2436670
DOI10.1007/s10878-012-9494-7zbMath1286.90159OpenAlexW2074999109MaRDI QIDQ2436670
Publication date: 25 February 2014
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-012-9494-7
Related Items (4)
Total and paired domination numbers of \(C_m\) bundles over a cycle \(C_n\) ⋮ On the domination number of $t$-constrained de Bruijn graphs ⋮ \([1,2\)-sets and \([1,2]\)-total sets in trees with algorithms] ⋮ THE DOMINATION NUMBER OF STRONG PRODUCT OF DIRECTED CYCLES
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On domination number of Cartesian product of directed paths
- 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
- Domination number of Cartesian products of directed cycles
- On domination of Cartesian product of directed cycles: Results for certain equivalence classes of lengths
- The Domination Number of Grids
- On dominating the Cartesian product of a graph and K2
- The domination numbers of the 5 × n and 6 × n grid graphs
This page was built for publication: The domination number of Cartesian product of two directed paths
