✦ LIBER ✦

On domination number of Cartesian product of

✍ Scribed by Juan Liu; Xindong Zhang; Jixiang Meng

Publisher: Springer US
Year: 2010
Tongue: English
Weight: 586 KB
Volume: 22
Category: Article
ISSN: 1382-6905
DOI: 10.1007/s10878-010-9314-x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On domination numbers of Cartesian produ

On domination numbers of Cartesian product of paths

✍ Sylvain Gravier; Michel Mollard 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 234 KB

We show the link between the existence of perfect Lee codes and minimum dominating sets of Cartesian products of paths and cycles. From the existence of such a code we deduce the asymptotical values of the domination numbers of these graphs.

On the Total Domination Number of Cartes

On the Total Domination Number of Cartesian Products of Graphs

✍ Michael A. Henning; Douglas F. Rall 📂 Article 📅 2005 🏛 Springer Japan 🌐 English ⚖ 261 KB

On the upper total domination number of

On the upper total domination number of Cartesian products of graphs

✍ Paul Dorbec; Michael A. Henning; Douglas F. Rall 📂 Article 📅 2007 🏛 Springer US 🌐 English ⚖ 310 KB

On the total {k}-domination number of Ca

On the total {k}-domination number of Cartesian products of graphs

✍ Ning Li; Xinmin Hou 📂 Article 📅 2008 🏛 Springer US 🌐 English ⚖ 261 KB

Dominating Cartesian products of cycles

✍ Sandi Klavžar; Norbert Seifter 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 578 KB

The determining number of a Cartesian pr

The determining number of a Cartesian product

✍ Debra L. Boutin 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 118 KB

## Abstract A set __S__ of vertices is a determining set for a graph __G__ if every automorphism of __G__ is uniquely determined by its action on __S__. The determining number of __G__, denoted Det(__G__), is the size of a smallest determining set. This paper begins by proving that if __G__=__G__□⋅