Perfect dominating sets in the Cartesian products of prime cycles
Hamed Hatami, Pooya Hatami
math.COarXiv:math/0701018
Abstract
We study the structure of a minimum dominating set of C2n+1n, the Cartesian product of n copies of the cycle of size 2n+1, where 2n+1 is a prime.
Create a lesson
Related papers
Counting with Hiccup Sequences
Benoit Cloitre
Degree similar and net-degree similar signed graphs
Matteo Cavaleri, Alfredo Donno
Clique and chromatic numbers of graph powers: spectral bounds and anticodes
Aida Abiad, Gabriel Coutinho, Hitesh Kumar et al.
Counting cographs in locally dense graphs
Hyunwoo Lee
Two-orbit right-angled Polytopes and Hypertopes
Claudio Alexandre Piedade, Philippe Tranchida
On the failure of additivity of inversion numbers for dijoins
Natalie Behague, Jack Cromwell