Perfect dominating sets in the Cartesian products of prime cycles

MaRDI QIDQ2372893zbMATH OpenFDO

Authors Hamed Hatami, Pooya Hatami

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, https://eudml.org/doc/127952, http://www.emis.de/journals/EJC/Volume_14/Abstracts/v14i1n8.html

IPFS 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

Review text

Summary: 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.

Cited in

(11)

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

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)