Betweenness Centrality in Some Classes of Graphs
Combinatorics
2014-03-20 v1
Abstract
There are several centrality measures that have been introduced and studied for real world networks. They account for the different vertex characteristics that permit them to be ranked in order of importance in the network. Betweenness centrality is a measure of the influence of a vertex over the flow of information between every pair of vertices under the assumption that information primarily flows over the shortest path between them. In this paper we present betweenness centrality of some important classes of graphs.
Keywords
Cite
@article{arxiv.1403.4701,
title = {Betweenness Centrality in Some Classes of Graphs},
author = {Sunil Kumar R and Kannan Balakrishnan and M. Jathavedan},
journal= {arXiv preprint arXiv:1403.4701},
year = {2014}
}
Comments
18 pages,2 figures