✦ LIBER ✦

On optimal orientations of cartesian products of graphs (I)

✍ Scribed by K.M. Koh; E.G. Tay

Publisher: Elsevier Science
Year: 1998
Tongue: English
Weight: 807 KB
Volume: 190
Category: Article
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(98)00038-7

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 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

Counting stable sets on Cartesian produc

Counting stable sets on Cartesian products of graphs

✍ Florence Forbes; Bernard Ycart 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 552 KB

We study the generating functions for the number of stable sets of all cardinalities, in the case of graphs which are Cartesian products by paths, cycles, or trees. Explicit results are given for products by cliques. Algorithms based on matrix products are derived for grids, cylinders, toruses and h

On super connectivity of Cartesian produ

On super connectivity of Cartesian product graphs

✍ Min Lü; Chao Wu; Guo-Liang Chen; Cheng Lv 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 176 KB

A theorem on integer flows on cartesian

A theorem on integer flows on cartesian products of graphs

✍ Wilfried Imrich; Riste Škrekovski 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 72 KB

## Abstract It is shown that the Cartesian product of two nontrivial connected graphs admits a nowhere‐zero 4‐flow. If both factors are bipartite, then the product admits a nowhere‐zero 3‐flow. © 2003 Wiley Periodicals, Inc. J Graph Theory 43: 93–98, 2003

Embedding Cartesian Products of Graphs i

Embedding Cartesian Products of Graphs into de Bruijn Graphs

✍ Thomas Andreae; Michael Nölle; Gerald Schreiber 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 172 KB

## Given a Cartesian product G of nontrivial connected graphs G i and the n-dimensional base B de Bruijn graph D = D B (n), it is investigated whether or not G is a spanning subgraph of D. Special attention is given to graphs G 1 × • • • × G m which are relevant for parallel computing, namely, to