𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Dominating Cartesian products of cycles

✍ Scribed by Sandi Klavžar; Norbert Seifter

Publisher
Elsevier Science
Year
1995
Tongue
English
Weight
578 KB
Volume
59
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On optimal orientations of Cartesian pro
On optimal orientations of Cartesian products of even cycles
✍ Koh, K. M.; Tay, E. G. 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 220 KB

For a graph G, let D(G) be the family of strong orientations of G. Define d ៝ (G) Å min {d(D)ÉD √ D(G)} and r(G) Å d ៝ (G) 0 d(G), where d(D) [respectively, d(G)] denotes the diameter of the digraph D (respectively, graph G). Let G 1 H denote the Cartesian product of the graphs G and H, and C p , th

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 optimal orientations of Cartesian pro
On optimal orientations of Cartesian products of even cycles and paths
✍ Koh, K. M.; Tay, E. G. 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 122 KB

For a graph G , let D ( G ) be the family of strong orientations of G , and define d ៝ ( G ) Å min{d(D)ÉD √ D(G)}, where d(D) is the diameter of the digraph D. In this paper, we evaluate the values of d ៝ (C 2n 1