The standard directed distance d(u, v) from u to v in a strong digraph D is the length of a shortest (directed) u-v path in D, A distance involving subdigraphs of the same order in D is introduced. This distance can be represented as the standard directed distance in its corresponding multivcrtex digraph, Several results concerning multivertex digraphs are then presented.
展开▼
