The eccentricity e(u) of a vertex u in a connected graph G is the distance between u and a vertex furthest from u. The minimum eccentricity among the vertices of G is the radius rad G of G, and the maximum The radial number m(u) of u is the minimum eccentricity among the eccentric vertices of u, wh
Peripheral and eccentric vertices in graphs
โ Scribed by K. B. Reid; Gu Weizhen
- Publisher
- Springer Japan
- Year
- 1992
- Tongue
- English
- Weight
- 658 KB
- Volume
- 8
- Category
- Article
- ISSN
- 0911-0119
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
B) a graph we mean a finite undirected connected graph of order p, p 2 2, with no loops or multrple edges. A finite non-decreasing sequence S : s,. s:.. . , sp p \* 2. of positive integers is an eccentric sequence if there exists a graph G with vertex set V(G) = {ul, o\_, . . . . u,,} such that for
The eccentricity e(v) of a vertex v in a connected graph G is the distance between v and a vertex farthest from v. The eccentricity e(G) of G is the minimum integer k such that every vertex of G with eccentricity at least k is an eccentric vertex. A graph G is an eccentric graph if every vertex of