Article citationsMore>>

J. Boland and M. Miller, “The Eccentric Digraph of a Digraph,” Proceedings of the 12th Australasian Workshop of Combinatorial Algorithms (AWOCA 2001), Freiburg, 3-7 September 2001, pp. 66-70.

has been cited by the following article:

• TITLE: On Eccentric Digraphs of Graphs

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

  KEYWORDS: Eccentric Vertex, Eccentric Degree, Eccentric Digraph, Degree Sequence, Eccentric Degree Sequence

  JOURNAL NAME: Applied Mathematics, Vol.2 No.6, June 21, 2011

  ABSTRACT: 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.