Please use this identifier to cite or link to this item: http://scholarbank.nus.edu.sg/handle/10635/103735
Title: On optimal orientations of cartesian products of graphs (II): Complete graphs and even cycles
Authors: Koh, K.M. 
Tay, E.G.
Issue Date: 28-Jan-2000
Source: Koh, K.M.,Tay, E.G. (2000-01-28). On optimal orientations of cartesian products of graphs (II): Complete graphs and even cycles. Discrete Mathematics 211 (1-3) : 75-102. ScholarBank@NUS Repository.
Abstract: For a graph G, let script D sign(G) be the family of strong orientations of G. Define d⇀(G)=min{d(D) /D ∈ script D sign(G)} and ρ(G) = d⇀(G) - d(G), where d(D) (resp., d(G)) denotes the diameter of the digraph D (resp., graph G). Let G × H denote the cartesian product of the graphs G and H, Kp the complete graph of order p and Cp the cycle of order p. In this paper, we show that ρ(K2 × C2m) = 2, ρ(Kn × C2m) = 1 for n = 3,4,5,7, and ρ(Kn × C2m) = 0 for most cases otherwise. © 2000 Elsevier Science B.V. All rights reserved.
Source Title: Discrete Mathematics
URI: http://scholarbank.nus.edu.sg/handle/10635/103735
ISSN: 0012365X
Appears in Collections:Staff Publications

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

Page view(s)

30
checked on Feb 22, 2018

Google ScholarTM

Check


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