Title of article
Optimal orientations of products of paths and cycles Original Research Article
Author/Authors
K.M. Koh، نويسنده , , E.G. Tay، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 1996
Pages
12
From page
163
To page
174
Abstract
For a graph G, let D(G) be the family of strong orientations of G, d(G) = min{d(D)∣D ∈ D (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
Keywords
Path , Cycle , Strong orientation , Diameter , Bipartite graph
Journal title
Discrete Applied Mathematics
Serial Year
1996
Journal title
Discrete Applied Mathematics
Record number
884629
Link To Document