✦ LIBER ✦

On Optimal Orientations of Cartesian Products of Trees

✍ Scribed by Khee Meng Koh; E. G. Tay

Publisher: Springer Japan
Year: 2001
Tongue: English
Weight: 220 KB
Volume: 17
Category: Article
ISSN: 0911-0119
DOI: 10.1007/s003730170057

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 graphs (I)

✍ K.M. Koh; E.G. Tay 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 807 KB

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

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

On the crossing numbers of Cartesian pro

On the crossing numbers of Cartesian products with trees

✍ Drago Bokal 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 204 KB

## Abstract Zip product was recently used in a note establishing the crossing number of the Cartesian product __K__~1~,__n__ □ __P__~m~. In this article, we further investigate the relations of this graph operation with the crossing numbers of graphs. First, we use a refining of the embedding metho

Optimal orientations of products of path

Optimal orientations of products of paths and cycles

✍ K.M. Koh; E.G. Tay 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 656 KB

For a graph G, let 9(G) be the family of strong orientations of G, d(G) = min{d(D) / D t 9' (G)} and p(G) = d(G) -d(G), where d(G) and d(D) are the diameters of G and D respectively. In this paper we show that p(G) = 0 if G is a Cartesian product of (I ) paths, and (2) paths and cycles, which satis