Optimal orientations of products of paths and cycles (Q1377664)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1109941
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Optimal orientations of products of paths and cycles |
scientific article; zbMATH DE number 1109941 |
Statements
Optimal orientations of products of paths and cycles (English)
0 references
10 May 1998
0 references
For a graph \(G\), let \(d_0(G)\) be the minimum diameter of a strong orientation of \(G\). The authors consider \(\rho(G)= d_0(G)- d(G)\), where \(d(G)\) is the diameter of \(G\). It is shown that \(\rho(G)= 0\) if \(G\) is a Cartesian product of (1) paths, and (2) paths and cycles, which satisfy some mild conditions.
0 references
distance
0 references
directed graphs
0 references
strong orientation
0 references
diameter
0 references
0 references
0.95882654
0 references
0.9536195
0 references
0.9402402
0 references
0.90647364
0 references
0.9044873
0 references
0.90315485
0 references
0.89763105
0 references
0.8969017
0 references
