期刊名称：International Journal of Advances in Soft Computing and Its Applications
印刷版ISSN：2074-8523
出版年度：2016
卷号：8
期号：2
出版社：International Center for Scientific Research and Studies
摘要：Let G=(V,A) be a digraph. The eccentricity e(u) of a vertex u is the maximum distance from u to any other vertex in G. A vertex v in G is an eccentric vertex of u if the distance from u to v equals e(u). The eccentric digraph ED(G) of a digraph G has the same vertex set as G and has arcs from a vertex v to its eccentric vertices. In this paper we present several results on the eccentric digraph of a tournament
