Abstract
Let G be a connected graph. The eccentricity of a vertex v is defined as the distance in G between v and a vertex farthest from v. The non decreasing sequence of the eccentricities of the vertices of G is the eccentric sequence of G. In this paper, we characterize eccentric sequences of maximal outerplanar graphs.
| Original language | English |
|---|---|
| Pages (from-to) | 376-391 |
| Number of pages | 16 |
| Journal | Australasian Journal of Combinatorics |
| Volume | 58 |
| Issue number | 3 |
| Publication status | Published - 2014 |
ASJC Scopus subject areas
- Discrete Mathematics and Combinatorics