Author(s)

Medha Itagi Huilgol, Syed Asif Ulla S., Sunilchandra A. R.

.

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 eccentric digraph ED(G) of a graph (digraph) G is the digraph that has the same vertex as G and an arc from u to v exists in ED(G) if and only if v is an eccentric vertex of u in G. In this paper, we have considered an open problem. Partly we have characterized graphs with specified maximum degree such that ED(G) = G.

Eccentric Vertex, Eccentric Degree, Eccentric Digraph, Degree Sequence, Eccentric Degree Sequence

Huilgol, M. , Asif Ulla S., S. and A. R., S. (2011) On Eccentric Digraphs of Graphs. Applied Mathematics, 2, 705-710. doi: 10.4236/am.2011.26093.