Identifying influential nodes in complex networks has attracted much attention because of its
great theoretical significance and wide application. The m-Ranking method takes into
account degree of all nodes and weight of all edges to rank nodes of the network with
different weight. This ranking method can be used for unweighted networks also by fixing the
value of the parameter α= 1. In addition, we demonstrate our new method on a real air traffic
network and show that the ranks calculated using the new method is more meaningful …