Counting rooted forests in a network [PDF]
Oliver KnillThe integer det(1+L) is the number of rooted spanning forests in a finite simple graph G with Laplacian L.View original: http://arxiv.org/abs/1307.3810
The integer det(1+L) is the number of rooted spanning forests in a finite simple graph G with Laplacian L.View original: http://arxiv.org/abs/1307.3810
No comments:
Post a Comment