On optimal orientations of Cartesian products of graphs. II: Complete graphs and even cycles (Q1969779)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On optimal orientations of Cartesian products of graphs. II: Complete graphs and even cycles |
scientific article; zbMATH DE number 1417395
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On optimal orientations of Cartesian products of graphs. II: Complete graphs and even cycles |
scientific article; zbMATH DE number 1417395 |
Statements
On optimal orientations of Cartesian products of graphs. II: Complete graphs and even cycles (English)
0 references
8 October 2000
0 references
Let \(\text{diam}_{\min}(G)\) be the minimum diameter of the orientation of a graph \(G\). The authors prove that for \(n\geq 8\), \(\text{diam}_{\min}(K_n\times C_{2m})= \text{diam}(K_n\times C_{2m})\) in most cases. A short overview of minimum diameter orientations of various classes of graphs is also provided.
0 references
Cartesian products
0 references
even cycles
0 references
diameter
0 references
orientation
0 references
0.95576006
0 references
0.95013475
0 references
0.94953614
0 references
0.9393079
0 references
0.9373841
0 references
0.90315485
0 references
0 references
0.8935187
0 references
