𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Direct Calculation of a Tree Length Using a Distance Matrix

✍ Scribed by Yves Pauplin

Book ID
105933522
Publisher
Springer
Year
2000
Tongue
English
Weight
796 KB
Volume
51
Category
Article
ISSN
0022-2844

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On the distance matrix of a directed gra
On the distance matrix of a directed graph
✍ R. L. Graham; A. J. Hoffman; H. Hosoya πŸ“‚ Article πŸ“… 1977 πŸ› John Wiley and Sons 🌐 English βš– 144 KB πŸ‘ 2 views

## 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 _

Distance matrix and Laplacian of a tree
Distance matrix and Laplacian of a tree with attached graphs
✍ R.B. Bapat πŸ“‚ Article πŸ“… 2005 πŸ› Elsevier Science 🌐 English βš– 172 KB

A tree with attached graphs is a tree, together with graphs defined on its partite sets. We introduce the notion of incidence matrix, Laplacian and distance matrix for a tree with attached graphs. Formulas are obtained for the minors of the incidence matrix and the Laplacian, and for the inverse and