Geometry of minimum spanning trees on scale-free networks

The minimum spanning trees on scale-free graphs are shown to be scale-free as well, in the presence of random edge weights. The probability distribution of the weights on the tree differs from regular lattices reflecting the typically short distances (small-world property). We consider also the trees in the absence of such randomness and the ensuing massive degeneracy, which is analyzed with graph theoretical arguments.