This is the authors' abstract. We don't add key points for this paper.
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 D(G ), does not vanish, we have the very attractive formula magnified image .
Answers are grounded in this paper and cite their sources.
No takes yet. Share an insight, caveat, or question.
Graham et al. (1977) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: