Dominating Cartesian products of cycles (Q1891923)
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: Dominating Cartesian products of cycles |
scientific article; zbMATH DE number 761079
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Dominating Cartesian products of cycles |
scientific article; zbMATH DE number 761079 |
Statements
Dominating Cartesian products of cycles (English)
0 references
26 October 1995
0 references
A set of vertices \(D\) in a graph is dominating if every vertex of the graph is adjacent to some vertex from \(D\). The domination number of the graph is the size of a smallest dominating set. The paper discusses the computation of the domination number of Cartesian products of graphs and an algorithm for finding minimum dominating sets in such graphs.
0 references
cycles
0 references
domination number
0 references
dominating set
0 references
Cartesian products
0 references
algorithm
0 references
