THE ECCENTRIC DIGRAPH OF ( ) t n, -KITE GRAPH
Tri Atmojo Kusmayadı, Nugroho Arif Sudibyo, Sri Kuntari · 2013
Let G be a graph with a set of vertices ( ) G V and a set of edges (). G E The distance from vertex u to vertex v in G is the length of the shortest path from vertex u to v. The eccentricity ( ) u e of a vertex u is the maximum distance of u to any other vertices of G. A vertex v is an eccentric vertex of vertex u if the distance from u to v is equal to (). u e The eccentric digraph ( ) G ED of a graph G is the digraph that has the same set of vertices as G, and there is an arc (directed edge) from u to v in () G ED if and only if v is an eccentric vertex of u in G.