Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2502.05873 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866913684825047040 |
|---|---|
| author | Liu, Jing Zhou, Hui |
| author_facet | Liu, Jing Zhou, Hui |
| contents | For a graph $G$, let $\mathbb{D}(G)$ denote the set of all strong orientations of $G$, and the oriented diameter of $G$ is $f(G)=\min \{diam(D) \mid D \in \mathbb{D}(G)\}$, which is the minimum value of the diameters $diam(D)$ where $D \in \mathbb{D}(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)$. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2502_05873 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Oriented diameter of the complete tripartite graph (II) Liu, Jing Zhou, Hui Combinatorics 05C20, 05C12 For a graph $G$, let $\mathbb{D}(G)$ denote the set of all strong orientations of $G$, and the oriented diameter of $G$ is $f(G)=\min \{diam(D) \mid D \in \mathbb{D}(G)\}$, which is the minimum value of the diameters $diam(D)$ where $D \in \mathbb{D}(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)$. |
| title | Oriented diameter of the complete tripartite graph (II) |
| topic | Combinatorics 05C20, 05C12 |
| url | https://arxiv.org/abs/2502.05873 |