2025/02/09 by Liu, Jing, Zhou, Hui
#05C12 #05C20 #Combinatorics (math.CO) #FOS: Mathematics
paper · doi:10.48550/arxiv.2502.05873
For a graph G, let \mathbbD(G) denote the set of all strong orientations of G, and the oriented diameter of G is f(G)=min \diam(D) | D ∈ \mathbbD(G)\, which is the minimum value of the diameters diam(D) where D ∈ \mathbbD(G). In this paper, we determine the oriented diameter of complete tripartite graphs K(3,3, q) and K(3,4, q), these are special cases that arise in determining the oriented diameter of K(3, p, q).