Oriented diameter of the complete tripartite graph (II)
Jing Liu, Hui Zhou

TL;DR
This paper determines the minimum possible diameters of strongly oriented complete tripartite graphs, specifically for the cases K(3,3,q) and K(3,4,q), advancing understanding of their directed properties.
Contribution
It provides the exact oriented diameters for K(3,3,q) and K(3,4,q), filling gaps in the knowledge of oriented diameters for these specific tripartite graphs.
Findings
Oriented diameter of K(3,3,q) determined
Oriented diameter of K(3,4,q) determined
Results aid in understanding the oriented diameter of K(3,p,q)
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 .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGraph theory and applications · graph theory and CDMA systems · Graph Labeling and Dimension Problems
