In dictionaries:
Betweenness centrality
In graph theory, betweenness centrality is a measure of centrality in a graph based on shortest paths.
Eigenvector centrality
In graph theory, eigenvector centrality (also called eigencentrality or prestige score) is a measure of the influence of a node in a connected network.
Closeness centrality
In a connected graph, closeness centrality (or closeness) of a node is a measure of centrality in a network, calculated as the reciprocal of the sum of the length of the shortest paths between the node and all other nodes in the graph.
Katz centrality
In graph theory, the Katz centrality or alpha centrality of a node is a measure of centrality in a network.
opposite of centrality
prefix denoting centrality
more...