Betweenness Centrality in Some Classes of Graphs. (25th December 2014)

• Record Type: Journal Article
• Authors: Raghavan Unnithan, Sunil Kumar; Kannan, Balakrishnan; Jathavedan, Madambi
• Other Names: Rodger Chris A. Academic Editor.
• Is Part Of: International journal of combinatorics. Volume 2014(2014)
• Publication Date: 2014-12-25
• Subjects: Combinatorial analysis -- Periodicals; Combinatorial analysis; Periodicals; Electronic journals; 511.605
• DOI: 10.1155/2014/241723
• Languages: English
• ISSNs: 1687-9163

Abstract

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