✦ LIBER ✦

On domination numbers of Cartesian product of paths

✍ Scribed by Sylvain Gravier; Michel Mollard

Publisher: Elsevier Science
Year: 1997
Tongue: English
Weight: 234 KB
Volume: 80
Category: Article
ISSN: 0166-218X
DOI: 10.1016/s0166-218x(97)00091-7

No coin nor oath required. For personal study only.

✦ Synopsis

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.

📜 SIMILAR VOLUMES

On domination number of Cartesian produc

On domination number of Cartesian product of

✍ Juan Liu; Xindong Zhang; Jixiang Meng 📂 Article 📅 2010 🏛 Springer US 🌐 English ⚖ 586 KB

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

Cartesian products of trees and paths

✍ Bandelt, Hans-J�rgen; Burosch, Gustav; Laborde, Jean-Marie 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 581 KB

We characterize the (weak) Cartesian products of trees among median graphs by a forbidden 5-vertex convex subgraph. The number of tree factors (if finite) is half the length of a largest isometric cycle. Then a characterization of Cartesian products of n trees obtains in terms of isometric cycles an