Table of Contents
International Journal of Combinatorics
Volume 2014, Article ID 241723, 12 pages
Research Article

Betweenness Centrality in Some Classes of Graphs

Department of Computer Applications, Cochin University of Science and Technology, Cochin 682022, India

Received 21 May 2014; Accepted 21 October 2014; Published 25 December 2014

Academic Editor: Chris A. Rodger

Copyright © 2014 Sunil Kumar Raghavan Unnithan et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.


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 paths between them. In this paper we present betweenness centrality of some important classes of graphs.