A new centrality measure for complex networks, called resource flow centrality, is pro- posed in this paper. This centrality measure is based on the concept of the resource flow in net- works. It not only can be applied to the connected networks, but also the disconnected networks. Moreover, it overcomes some disadvantages of several common centrality measures. The perform- ance of the proposed measure is compared with some standard centrality measures using a classic dataset and the results indicate the proposed measure performs more reasonably. The statistical dis- tribution of the proposed centrality is investigated by experiments on large scale computer generated graphs and two networks from the real world.
