Oriented diameter of maximal outerplanar graphs.

Let G be a finite connected undirected graph and G⇀ a strong orientation of G. The diameter of G⇀, denoted by diam(G⇀), is the maximum directed distance between any two vertices of G⇀. The oriented diameter of G is defined as diam⇀(G)=min{diam(G⇀)∣G⇀is a strong orientation ofG}. In this paper, we show that diam⇀(G)≤⌈n∕2⌉ for any maximal outerplanar graph G of order n≥3, with four exceptions, and the upper bound is sharp. [ABSTRACT FROM AUTHOR]