Oriented diameter of maximal outerplanar graphs

Journal of Graph Theory, vol. 98, pp. 426–444

Abstract

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.

Authors 6

1. Xiaolin Wang

   Nanjing University

   Affiliation as printed

   Department of Mathematics Nanjing University Nanjing China

   Department of Mathematics, Nanjing University, Nanjing, China

2. Yaojun Chen corresponding

   Nanjing University

   Affiliation as printed

   Department of Mathematics Nanjing University Nanjing China

   Department of Mathematics, Nanjing University, Nanjing, China

3. Peter Dankelmann

   University of Johannesburg

   Affiliation as printed

   Department of Mathematics and Applied Mathematics University of Johannesburg Johannesburg South Africa

   Department of Mathematics and Applied Mathematics, University of Johannesburg, Johannesburg, South Africa

4. Yubao Guo Aachen Chair for Mathematics of Information Processing

   RWTH Aachen University

   Affiliation as printed

   Chair for Mathematics of Information Processing RWTH Aachen University Aachen Germany

   Chair for Mathematics of Information Processing, RWTH Aachen University, Aachen, Germany

5. Michel Surmacs Aachen Chair for Mathematics of Information Processing

   RWTH Aachen University

   Affiliation as printed

   Chair for Mathematics of Information Processing RWTH Aachen University Aachen Germany

   Chair for Mathematics of Information Processing, RWTH Aachen University, Aachen, Germany

6. Lutz Volkmann Aachen Lehrstuhl II für Mathematik

   RWTH Aachen University

   Affiliation as printed

   Lehrstuhl II für Mathematik RWTH Aachen University Aachen Germany