Premium
On optimal orientations of Cartesian products of even cycles and paths
Author(s) -
Koh K. M.,
Tay E. G.
Publication year - 1997
Publication title -
networks
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.977
H-Index - 64
eISSN - 1097-0037
pISSN - 0028-3045
DOI - 10.1002/(sici)1097-0037(199708)30:1<1::aid-net1>3.0.co;2-h
Subject(s) - cartesian product , cartesian coordinate system , computer science , mathematics , mathematical optimization , path (computing) , combinatorics , geometry , programming language
For a graph G , let ( G ) be the family of strong orientations of G , and define d ⇀( G )= min{ d ( D )| D ∈ ( G )}, where d ( D ) is the diameter of the digraph D . In this paper, we evaluate the values of d ⇀( C 2 n P k ), where n ≥ 2 and k ≥ 2. © 1997 John Wiley & Sons, Inc. Networks 30:1–7, 1997