The diameter of an orientation of a complete multipartite graph [Discrete Math. 149 (1996) 131–139]

✍ Scribed by K.M. Koh; B.P. Tan

Publisher: Elsevier Science
Year: 1997
Tongue: English
Weight: 58 KB
Volume: 173
Category: Article
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(97)00054-x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The diameter of an orientation of a comp

The diameter of an orientation of a complete multipartite graph

✍ K.M. Koh; B.P. Tan 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 390 KB

For a graph G, let e(G) denote the minimum value of the diameters diamD of D, where D runs through all the orientations of G. In this paper, we obtain some results on e(G) for complete multipartite graphs G, which extend some known results due to Boesch and Tindell [1] and Maurer [4].