Skip to main content

All Questions

Filter by
Sorted by
Tagged with
3 votes
1 answer
200 views

Matrix-tree theorem for inverse matrices

Let $L$ be the Laplacian of a directed weighted graph on $n$ nodes, e.g., for $n=4$: $$ L = \left(\begin{array}{cccc} w_{1,1}+w_{1,2}+w_{1,3}+w_{1,4} & -w_{1,2} & -w_{1,3} & -w_{1,4}\\ ...
Federico Poloni's user avatar