Scale-free trees: The skeletons of complex networks

Dong Hee Kim, Jae Dong Noh, Hawoong Jeong

Research output: Contribution to journalArticlepeer-review

19 Scopus citations


We investigate the properties of the spanning trees of various real-world and model networks. The spanning tree representing the communication kernel of the original network is determined by maximizing the total weight of the edges, whose weights are given by the edge betweenness centralities. We find that a scale-free tree and shortcuts organize a complex network. Especially, in ubiquitous scale-free networks, it is found that the scale-free spanning tree shows very robust betweenness centrality distributions and the remaining shortcuts characterize the properties of the original network, such as the clustering coefficient and the classification of scale-free networks by the betweenness centrality distribution.

Original languageEnglish
Pages (from-to)5
Number of pages1
JournalPhysical Review E
Issue number4
StatePublished - 2004


Dive into the research topics of 'Scale-free trees: The skeletons of complex networks'. Together they form a unique fingerprint.

Cite this