The domination number of strong product of directed cycles (Q2875686)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The domination number of strong product of directed cycles |
scientific article; zbMATH DE number 6328438
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The domination number of strong product of directed cycles |
scientific article; zbMATH DE number 6328438 |
Statements
11 August 2014
0 references
domination number
0 references
strong product
0 references
directed cycles
0 references
The domination number of strong product of directed cycles (English)
0 references
The domination number of the Cartesian product of directed cycles and paths has been discussed in the literature. There are some related works for the strong product of two graphs or digraphs. The paper obtains the domination number for the strong product of two directed cycles. In addition, it gives a lower bound and an upper bound of the domination number for the strong product of \(n\) directed cycles, and obtains the exact value when at least \(n - 2\) of these \(n\) integers are even.
0 references
