The center of a graph is the set of vertices with minimum eccentricity. Graphs in which all
vertices are central are called self-centered graphs. In this paper almost self-centered (ASC) …

The center and the periphery of a graph is the set of vertices with minimum resp. maximum
eccentricity in it. A graph is almost self-centered (ASC) if it contains exactly two non-central …

A broom graph Bn, d is a specific kind of graph on n vertices, having a path P with d vertices
and nd pendant vertices, all of these being adjacent to either the origin u or the terminus v of …

We study graph-theoretic properties of eccentric digraphs of unique eccentric point graphs
(shortly, uep-graphs). The latter are the connected graphs in which every vertex has a …

The eccentricity e (u) of a vertex u is the maximum distance of u to any other vertex of G. A
vertex v is an eccentric vertex of vertex u if the distance from u to v is equal to e (u). The …

A prime cordial labeling of a graph G with the vertex set V (G) is a bijection f: V (G)→{1, 2,
3,…..,| V (G)|} such that each edge uv is assigned the label 1 if gcd (f (u), f (v))= 1 and 0 if gcd …

Let G be a graph with a set of vertices () GV and a set of edges (). GE The distance from
vertex u to vertex v in G is the length of the shortest path from vertex u to v. The eccentricity () …

In a graph G, the distance d (u, v) between a pair of vertices u and v is the length of a
shortest path joining them. The eccentricity e (u) of a vertex u is the distance to a vertex …

У роботі досліджено клас унікально-ексцентрично-точкових графів та їх ексцентричних
орграфів. Розроблено еволюційний алгоритм, для пошуку у. е. т.-графів із заданими …

THE ECCENTRIC DIGRAPH OF CORONA OF K WITH ANY GRAPH H Page 1 Far East Journal
of Mathematical Sciences (FJMS) © 2013 Pushpa Publishing House, Allahabad, India …