On the distance matrix of a directed graph
- 1 March 1977
- journal article
- research article
- Published by Wiley in Journal of Graph Theory
- Vol. 1 (1) , 85-88
- https://doi.org/10.1002/jgt.3190010116
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 Gi of G. In particular, when cof D(G), the sum of the cofactors of D(G), does not vanish, we have the very attractive formula magnified image .Keywords
This publication has 5 references indexed in Scilit:
- New Bounds on the Complexity of the Shortest Path ProblemSIAM Journal on Computing, 1976
- On the distance matrix of a treeDiscrete Mathematics, 1976
- On the Addressing Problem for Loop SwitchingBell System Technical Journal, 1971
- GRAPH THEORYPublished by Defense Technical Information Center (DTIC) ,1969
- A note on two problems in connexion with graphsNumerische Mathematik, 1959