The minimum diameter of orientations of complete multipartite graphs

DOI10.1007/BF01858466zbMath0861.05029OpenAlexW2025604967MaRDI QIDQ2563422

B. P. Tan, Khee Meng Koh

Publication date: 4 May 1997

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01858466

zbMATH Keywords

diameterorientationmultipartite tournamentsmultipartite digraphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Directed graphs (digraphs), tournaments (05C20)

Related Items (13)

Minimum average distance of strong orientations of graphs ⋮ Addendum to: The diameter of an orientation of a complete multipartite graph [Discrete Math. 149 (1996) 131--139] ⋮ A size condition for diameter two orientable graphs ⋮ On optimal orientations of complete tripartite graphs ⋮ Optimal orientations of products of paths and cycles ⋮ On optimal orientations of Cartesian products with a bipartite graph ⋮ A degree condition for diameter two orientability of graphs ⋮ Oriented diameter of graphs with diameter 3 ⋮ The orientation number of two complete graphs with linkages ⋮ On a conjecture concerning the orientation number of a graph ⋮ On optimal orientation of cycle vertex multiplications ⋮ On optimal orientations of Cartesian products of graphs. I ⋮ Diameter of orientations of graphs with given minimum degree

Cites Work

• Unnamed Item
• Every vertex a king
• Distances in orientations of graphs
• Minimizing and maximizing the diameter in orientations of graphs
• The diameter of an orientation of a complete multipartite graph
• Robbins's Theorem for Mixed Multigraphs
• A Theorem on Graphs, with an Application to a Problem of Traffic Control

This page was built for publication: The minimum diameter of orientations of complete multipartite graphs