On the distance matrix of a directed graph
Lists
Only you see this
Abstract
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 D(G ), does not vanish, we have the very attractive formula magnified image .
BibTeX
@article{graham1977distance,
author = {Ronald Graham and A. J. Hoffman and Haruo Hosoya},
title = {{On the distance matrix of a directed graph}},
journal = {Journal of Graph Theory},
year = {1977},
doi = {10.1002/jgt.3190010116},
}Loading related content...