Eccentric digraphs of trees (Q326892): Difference between revisions

Summary: In a digraph \(G\), the eccentricity \(e(u)\) of a vertex \(u\) is the maximum distance from \(u\) to any other vertex in \(G\). A vertex \(v\) is an eccentric vertex of \(u\) if the distance from \(u\) to \(v\) equals \(e(u)\). An eccentric digraph \(\mathrm{ED}(G)\) of a graph \(G\) has vertices, same as that of \(G\) but has directed edges that correspond to the relation that \(v\) is an eccentric vertex of \(u\). In other words, there are directed edges in \(\mathrm{ED}(G)\) from a vertex \(u\) to those vertices \(v\) which are farthest from \(u\). In this paper we have examined the problem of finding the structure of the second iterated eccentric digraph of a tree and obtained a solution.