This function reproduces some of the most significant classic Social Network Theory's centrality measures. See Wasserman (1994), Freeman (1978), or Bonacich & Lloyd (2001) to know more.
a) Degree = Degree centrality is measured by the total amount of direct links with the other nodes.
b) Closeness = Closeness centrality is meant to measure one node to the others nodes' sum distances
c) Betweenness = Betweenness centrality measures one node undertaking "mediation" role in a network.
d) Eigen = Eigenvector centrality measures a node's importance while giving consideration to the importance of its neighbors.
By default, measures = "all", thus all the measures will be calculated. The function can be applied to an igraph or a netCoin object. In case the graph is undirected, it will show the degree, weighted degree, closeness, betweeness and eigen degree. Moreover, if it us directed, it will show the indegree, windegree and outdegree, both weighted and unweighted (See example.).