Oriented diameter of maximal outerplanar graphs
Xiaolin Wang, Yaojun Chen, Peter Dankelmann, Yubao Guo, Michel Surmacs, Lutz Volkmann · Journal of Graph Theory · 2021
Abstract Let be a finite connected undirected graph and a strong orientation of . The diameter of , denoted by , is the maximum directed distance between any two vertices of . The oriented diameter of is defined as In this paper, we show that for any maximal outerplanar graph of order , with four exceptions, and the upper bound is sharp.