On Directed Graphs with the Same Sum over Arborescence Weights
Sayani Ghosh, Bradley S. Meyer
Abstract
We show that certain digraphs with the same vertex set but different arc sets have the same sum over the weights of all arborescences with a given root vertex. We relate our results to the Matrix-Tree Theorem and show how they provide a graphical approach for factoring matrix determinants.
