Please use this identifier to cite or link to this item:
Title: On optimal orientations of Cartesian products of even cycles
Authors: Koh, K.M. 
Tay, E.G.
Issue Date: Dec-1998
Citation: Koh, K.M.,Tay, E.G. (1998-12). On optimal orientations of Cartesian products of even cycles. Networks 32 (4) : 299-306. ScholarBank@NUS Repository.
Abstract: 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 ρ(G) = d⇀(G) - d(G), where d(D) [respectively, d(G)] denotes the diameter of the digraph D (respectively, graph G). Let G × H denote the Cartesian product of the graphs G and H, and Cp, the cycle of order p. In this paper, we show that ρ(C2m × C2n) = 0 and ρ(C2m × C2n × G1 × G2 × ⋯ × Gk) = 0, where {Gi | 1 ≤ i ≤ k} is any combination of paths and cycles. © 1998 John Wiley & Sons, Inc. Networks 32: 299-306, 1998.
Source Title: Networks
ISSN: 00283045
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

Page view(s)

checked on Oct 12, 2018

Google ScholarTM


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.