Please use this identifier to cite or link to this item:
https://scholarbank.nus.edu.sg/handle/10635/103735
DC Field | Value | |
---|---|---|
dc.title | On optimal orientations of cartesian products of graphs (II): Complete graphs and even cycles | |
dc.contributor.author | Koh, K.M. | |
dc.contributor.author | Tay, E.G. | |
dc.date.accessioned | 2014-10-28T02:40:43Z | |
dc.date.available | 2014-10-28T02:40:43Z | |
dc.date.issued | 2000-01-28 | |
dc.identifier.citation | 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. | |
dc.identifier.issn | 0012365X | |
dc.identifier.uri | http://scholarbank.nus.edu.sg/handle/10635/103735 | |
dc.description.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. | |
dc.source | Scopus | |
dc.type | Article | |
dc.contributor.department | MATHEMATICS | |
dc.description.sourcetitle | Discrete Mathematics | |
dc.description.volume | 211 | |
dc.description.issue | 1-3 | |
dc.description.page | 75-102 | |
dc.description.coden | DSMHA | |
dc.identifier.isiut | NOT_IN_WOS | |
Appears in Collections: | Staff Publications |
Show simple item record
Files in This Item:
There are no files associated with this item.
Google ScholarTM
Check
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.