Back to Search
Start Over
Oriented diameter of maximal outerplanar graphs.
- Source :
-
Journal of Graph Theory . Nov2021, Vol. 98 Issue 3, p426-444. 19p. - Publication Year :
- 2021
-
Abstract
- 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]
- Subjects :
- *DIRECTED graphs
*UNDIRECTED graphs
*DIAMETER
*GRAPH connectivity
Subjects
Details
- Language :
- English
- ISSN :
- 03649024
- Volume :
- 98
- Issue :
- 3
- Database :
- Academic Search Index
- Journal :
- Journal of Graph Theory
- Publication Type :
- Academic Journal
- Accession number :
- 152468398
- Full Text :
- https://doi.org/10.1002/jgt.22707