๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

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


On eccentric vertices in graphs
โœ Chartrand, Gary; Schultz, Michelle; Winters, Steven J. ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 387 KB

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

Eccentric sequences and eccentric sets i
โœ M. Behzad; James E. Simpson ๐Ÿ“‚ Article ๐Ÿ“… 1976 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 679 KB

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

Eccentric graphs
โœ Chartrand, Gary; Gu, Weizhen; Schultz, Michelle; Winters, Steven J. ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 212 KB

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

Eccentric sequences in graphs
โœ Linda Lesniak ๐Ÿ“‚ Article ๐Ÿ“… 1975 ๐Ÿ› Springer Netherlands ๐ŸŒ English โš– 399 KB
End vertices in interval graphs
โœ John Gimbel ๐Ÿ“‚ Article ๐Ÿ“… 1988 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 289 KB