Perfect dominating sets in the Cartesian products of prime cycles
From MaRDI portal
Publication:2372893
zbMath1121.05086arXivmath/0701018MaRDI QIDQ2372893
Publication date: 16 July 2007
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0701018
Related Items (10)
Unnamed Item ⋮ Graph parameters, implicit representations and factorial properties ⋮ A note on the fair domination number in outerplanar graphs ⋮ On the domination number and the 2-packing number of Fibonacci cubes and Lucas cubes ⋮ Fair domination in graphs ⋮ Fair domination number in cactus graphs ⋮ Fair total domination number in cactus graphs ⋮ Combinatorics and algorithms for quasi-chain graphs ⋮ A counter-example to the probabilistic universal graph conjecture via randomized communication complexity ⋮ Domination in Cayley graphs: a survey
This page was built for publication: Perfect dominating sets in the Cartesian products of prime cycles