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

Eccentric graphs

โœ Scribed by Jin Akiyama; Kiyoshi Ando; David Avis


Publisher
Elsevier Science
Year
1985
Tongue
English
Weight
260 KB
Volume
56
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

โœฆ Synopsis


For any graph G we define the eccentric graph G e on the same set of vertices, by joining two vertices in G e if and only if one of the vertices has maximum possible distance from the other.

The following results are given in this paper:

(1) A few general properties of eccentric graphs.

(2) A characterization of graphs G with G c = K s and with Ge = pK 2.

(3) A solution of the equation G e = (~.


๐Ÿ“œ SIMILAR VOLUMES


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

Unique eccentric point graphs
โœ K.R. Parthasarathy; R. Nandakumar ๐Ÿ“‚ Article ๐Ÿ“… 1983 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 286 KB
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

Generalized eccentricity, radius, and di
โœ Dankelmann, Peter; Goddard, Wayne; Henning, Michael A.; Swart, Henda C. ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 101 KB ๐Ÿ‘ 1 views

For a vertex v and a (k ฯช 1)-element subset P of vertices of a graph, one can define the distance from v to P in various ways, including the minimum, average, and maximum distance from v to P. Associated with each of these distances, one can define the k-eccentricity of the vertex v as the maximum d

cover
โœ Donna Lea Simpson ๐Ÿ“‚ Fiction ๐Ÿ“… 2017 ๐Ÿ› Beyond the Page Publishing; Smashwords Edition ๐ŸŒ English โš– 105 KB ๐Ÿ‘ 2 views

Sorrow Marchand has patiently endured the taunts of London society for her bold speech and curious ways, yet it was those very qualities of the sparkling young beauty that caught the eye of the Honorable Bertram Carlyle and ultimately elicited an offer of marriage from him. But the usually candid So