Betweenness centrality in some classes of graphs

From MaRDI portal
Publication:2019271

DOI10.1155/2014/241723zbMATH Open1309.05168arXiv1403.4701OpenAlexW2092347555WikidataQ59043534 ScholiaQ59043534MaRDI QIDQ2019271FDOQ2019271


Authors: Sunil Kumar Raghavan Unnithan, B. Kannan, Madambi Jathavedan Edit this on Wikidata


Publication date: 27 March 2015

Published in: International Journal of Combinatorics (Search for Journal in Brave)

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.


Full work available at URL: https://arxiv.org/abs/1403.4701




Recommendations




Cites Work


Cited In (22)

Uses Software





This page was built for publication: Betweenness centrality in some classes of graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2019271)