Directed Distances with Derivatives
โ Scribed by E. Gonzalezvelasco; J. Grahameagle
- Publisher
- Elsevier Science
- Year
- 1994
- Tongue
- English
- Weight
- 370 KB
- Volume
- 184
- Category
- Article
- ISSN
- 0022-247X
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
## Abstract The directed distance __d__~__D__~(__u, v__) from a vertex __u__ to a vertex __v__ in a strong digraph __D__ is the length of a shortest (directed) __u โ v__ path in __D.__ The eccentricity of a vertex __v__ in __D__ is the directed distance from __v__ to a vertex furthest from __v.__ T
## Abstract In this note, we show how the determinant of the distance matrix __D(G__) of a weighted, directed graph __G__ can be explicitly expressed in terms of the corresponding determinants for the (strong) blocks __G~i~__ of __G__. In particular, when cof __D(G__), the sum of the cofactors of _