A characterisation of eccentric sequences of maximal outerplanar graphs

P. Dankelmann; D. J. Erwin; W. Goddard; S. Mukwembi; H. C. Swart

A characterisation of eccentric sequences of maximal outerplanar graphs

P. Dankelmann, D. J. Erwin, W. Goddard, S. Mukwembi, H. C. Swart

Mathematics and Applied Mathematics

Research output: Contribution to journal › Article › peer-review

7 Citations (Scopus)

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

Cite this

@article{da2069211f694b788a0c61fd56e0ce63,

title = "A characterisation of eccentric sequences of maximal outerplanar graphs",

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.",

author = "P. Dankelmann and Erwin, {D. J.} and W. Goddard and S. Mukwembi and Swart, {H. C.}",

year = "2014",

language = "English",

volume = "58",

pages = "376--391",

journal = "Australasian Journal of Combinatorics",

issn = "1034-4942",

publisher = "University of Queensland Press",

number = "3",

}

TY - JOUR

T1 - A characterisation of eccentric sequences of maximal outerplanar graphs

AU - Dankelmann, P.

AU - Erwin, D. J.

AU - Goddard, W.

AU - Mukwembi, S.

AU - Swart, H. C.

PY - 2014

Y1 - 2014

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84892895924&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:84892895924

SN - 1034-4942

VL - 58

SP - 376

EP - 391

JO - Australasian Journal of Combinatorics

JF - Australasian Journal of Combinatorics

IS - 3

ER -

A characterisation of eccentric sequences of maximal outerplanar graphs

Abstract

ASJC Scopus subject areas

Other files and links

Fingerprint

Cite this