Oriented diameter of the complete tripartite graph (III)

Abstract

Given a bridgeless graph G, let D(G) be the set of all strong orientations of G, and define the oriented diameter f(G) of G to be the minimum of diameters diam(D) among all the strong orientations D∈ D(G), i.e., f(G)=\diam(D) D∈ D(G)\. In this paper, we determine the oriented diameter of complete tripartite graph K(3,p,q) for p≥slant 5. Combining with the previous results, the oriented diameter of complete tripartite graph K(3,p,q) are known.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…