On the oriented diameter of 2-trees
Authors:
- Jiangdong AiJAJiangdong Ai
- Hanlin ChenHCHanlin Chen
- Peter DankelmannPDPeter Dankelmann
- Yuwan ZhangYZYuwan Zhang
Preprint
- 9 July 2026
- preprint
- Published by Elsevier in SSRN Electronic Journal
Abstract
Let $G$ be a finite connected undirected graph and $ \vec{G}$ be a strong orientation of $G$. The diameter of $\vec{G} $, denoted by $\text{diam}(\vec{G})$, is the maximum distance between any two vertices of $\vec{G}$. The oriented diameter of $G$ is defined as the minimum diameter over all strong orientations of $G$. In this paper, we establish an upper bound $\lceil\frac{n}{2}\rceil $ on the oriented diameter of an $n$-vertex 2-tree (except for five small exceptions). Furthermore, we show that this upper bound is tight. This extends a result for maximal outerplanar graphs [Wang et al., J. Graph Theory 98 no.\ 3, 2021] to all 2-trees.