2 search results - page 1 / 1 » Eccentricity sequences and eccentricity sets in digraphs |
ARSCOM
2008
13 years 5 months ago
2008
The eccentricity e(v) of a vertex v in a strongly connected digraph G is the maximum distance from v. The eccentricity sequence of a digraph is the list of eccentricities of its v...
DM
2006
13 years 5 months ago
2006
The eccentric digraph ED(G) of a digraph G represents the binary relation, defined on the vertex set of G, of being `eccentric'; that is, there is an arc from u to v in ED(G)...