Log in to see this item in other languages
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…
Creator
- Zhang, Ping
Subject
- strong distance
- strong eccentricity
- strong center
- strong periphery
Type of item
- model:article
Creator
- Zhang, Ping
Subject
- strong distance
- strong eccentricity
- strong center
- strong periphery
Type of item
- model:article
Providing institution
Aggregator
Rights statement for the media in this item (unless otherwise specified)
- http://creativecommons.org/publicdomain/mark/1.0/
Rights
- policy:public
Place-Time
- 557-570
Source
- Mathematica bohemica | 2002 Volume:127 | Number:4
Identifier
- uuid:dcae1238-8feb-4b19-86d9-2bff326f399b
- https://cdk.lib.cas.cz/client/handle/uuid:dcae1238-8feb-4b19-86d9-2bff326f399b
- uuid:dcae1238-8feb-4b19-86d9-2bff326f399b
- doi:10.21136/MB.2002.133957
Format
- bez média
- svazek
Language
- eng
- eng
Providing country
- Czech Republic
Collection name
First time published on Europeana
- 2021-06-01T12:19:28.026Z
Last time updated from providing institution
- 2021-06-01T12:19:28.026Z