✦ LIBER ✦

Unique eccentric point graphs

✍ Scribed by K.R. Parthasarathy; R. Nandakumar

Publisher: Elsevier Science
Year: 1983
Tongue: English
Weight: 286 KB
Volume: 46
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(83)90271-6

No coin nor oath required. For personal study only.

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

✍ Jin Akiyama; Kiyoshi Ando; David Avis 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 260 KB

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

Eccentric sequences and eccentric sets i

Eccentric sequences and eccentric sets in graphs

✍ 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

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

The uniqueness of the strongly regular g

The uniqueness of the strongly regular graph on 77 points

✍ A. E. Brouwer 📂 Article 📅 1983 🏛 John Wiley and Sons 🌐 English ⚖ 329 KB 👁 1 views

Generalized eccentricity, radius, and di

Generalized eccentricity, radius, and diameter in graphs

✍ 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