Minimum spanning trees for community detection

► A simple distance matrix is defined and then the minimum spanning tree is generated for a network. ► The phenomenon about the relation between the minimum spanning tree and the community structure is revealed. ► An algorithm for community detection is provided by using the two rounds minimum spanning tree. ► The algorithm is out of the problem of resolution limit.