Oriented diameter of the complete tripartite graph (II)
Combinatorics
2025-02-11 v1
Abstract
For a graph , let denote the set of all strong orientations of , and the oriented diameter of is , which is the minimum value of the diameters where . In this paper, we determine the oriented diameter of complete tripartite graphs and , these are special cases that arise in determining the oriented diameter of .
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}
}