The eccentric digraph of caterpillar graph and generalized Jahangir graph

Abstract

Let G be a graph with a finite set of vertices V(G) and set of edges E(G). Eccentric digraph ED(G) of a graph, G is a graph that has the same set of vertices as the set of vertices G, and there is an arc (directed edge) connecting vertices u to v if v is an eccentric vertex of u. In this paper, the eccentric digraph of the caterpillar graph and generalized Jahangir graph is obtained.