English

Oriented diameter of the complete tripartite graph (II)

Combinatorics 2025-02-11 v1

Abstract

For a graph GG, let D(G)\mathbb{D}(G) denote the set of all strong orientations of GG, and the oriented diameter of GG is f(G)=min{diam(D)DD(G)}f(G)=\min \{diam(D) \mid D \in \mathbb{D}(G)\}, which is the minimum value of the diameters diam(D)diam(D) where DD(G)D \in \mathbb{D}(G). In this paper, we determine the oriented diameter of complete tripartite graphs K(3,3,q)K(3,3, q) and K(3,4,q)K(3,4, q), these are special cases that arise in determining the oriented diameter of K(3,p,q)K(3, p, q).

Cite

@article{arxiv.2502.05873,
  title  = {Oriented diameter of the complete tripartite graph (II)},
  author = {Jing Liu and Hui Zhou},
  journal= {arXiv preprint arXiv:2502.05873},
  year   = {2025}
}
R2 v1 2026-06-28T21:37:42.833Z