Oriented diameter of the complete tripartite graph (III)
Combinatorics
2025-02-24 v1
Abstract
Given a bridgeless graph , let be the set of all strong orientations of , and define the oriented diameter of to be the minimum of diameters among all the strong orientations , i.e., . In this paper, we determine the oriented diameter of complete tripartite graph for . Combining with the previous results, the oriented diameter of complete tripartite graph are known.
Cite
@article{arxiv.2502.14903,
title = {Oriented diameter of the complete tripartite graph (III)},
author = {Jing Liu and Guang Rao and Hui Zhou},
journal= {arXiv preprint arXiv:2502.14903},
year = {2025}
}