Spanning edge betweenness

We present a new edge betweenness metric for undirected and weighted graphs. This metric is defined as the fraction of minimum spanning trees where a given edge is present and it was motivated by the necessity of evaluating phy-logenetic trees. Moreover we provide results and methods concerning the exact computation of this metric based on the well known Kirchhoff’s matrix tree theorem. Categories and Subject Descriptor