117
click to vote
COCOC
15 years 6 months ago
1995 
We consider the collection of all spanning trees of a graph with distance between them based on the size of the symmetric difference of their edge sets. A central spanning tree o...
|
Combinatorics