Perfect dominating sets in the Cartesian products of prime cycles

zbMATH Open1121.05086arXivmath/0701018MaRDI QIDQ2372893FDOQ2372893

Authors: Hamed Hatami, Pooya Hatami 

Publication date: 16 July 2007

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Abstract: We study the structure of a minimum dominating set of $C_{2n+1}^n$, the Cartesian product of $n$ copies of the cycle of size $2n+1$, where $2n+1$ is a prime.

Full work available at URL: https://arxiv.org/abs/math/0701018

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cited In (11)

• Graph parameters, implicit representations and factorial properties
• Fair domination in graphs
• Fair total domination number in cactus graphs
• Perfect r-domination in the Kronecker product of three cycles
• Domination in Cayley graphs: a survey
• On the domination number and the 2-packing number of Fibonacci cubes and Lucas cubes
• Title not available (Why is that?)
• Combinatorics and algorithms for quasi-chain graphs
• A counter-example to the probabilistic universal graph conjecture via randomized communication complexity
• A note on the fair domination number in outerplanar graphs
• Fair domination number in cactus graphs

This page was built for publication: Perfect dominating sets in the Cartesian products of prime cycles

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2372893)