Sciweavers

2 search results - page 1 / 1
» Perfect Dominating Sets in the Cartesian Products of Prime C...
Sort
View
COMBINATORICS
2007
50views more  COMBINATORICS 2007»
13 years 4 months ago
Perfect Dominating Sets in the Cartesian Products of Prime Cycles
We study the structure of a minimum dominating set of Cn 2n+1, the Cartesian product of n copies of the cycle of size 2n + 1, where 2n + 1 is a prime.
Hamed Hatami, Pooya Hatami
DM
1998
73views more  DM 1998»
13 years 4 months ago
On constructing snakes in powers of complete graphs
We prove the conjecture of Abbott and Katchalski that for every m ≥ 2 there is a positive constant λm such that S(Kd mn) ≥ λmnd−1 S(Kd−1 m ) where S(Kd m) is the length o...
Jerzy Wojciechowski