You're viewing this item in the new Europeana website. View this item in the original Europeana.

On k-strong distance in strong digraphs

For a nonempty set S of vertices in a strong digraph D, the strong distance d(S) is the minimum size of a strong subdigraph of D containing the vertices of S. If S contains k vertices, then d(S) is referred to as the k-strong distance of S. For an integer k ≥ 2 and a vertex v of a strong digraph D, the k-strong eccentricity sek(v) of v is the maximum k-strong distance d(S) among all sets S of k ve…