Betweenness Centrality in Some Classes of Graphs

Dyuthi/Manakin Repository

Betweenness Centrality in Some Classes of Graphs

Show simple item record Kannan, Balakrishnan Sunil Kumar, R Jathavedan, M 2014-07-22T09:09:46Z 2014-07-22T09:09:46Z 2014-03-19
dc.description arXiv preprint arXiv:1403.4701 en_US
dc.description.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. en_US
dc.description.sponsorship Cochin University of Science and Technology en_US
dc.language.iso en en_US
dc.subject betweenness centrality measures en_US
dc.subject perfect matching en_US
dc.subject dual graph en_US
dc.subject interval regular en_US
dc.subject branch of a tree en_US
dc.subject antipodal vertices en_US
dc.subject tearing. en_US
dc.title Betweenness Centrality in Some Classes of Graphs en_US
dc.type Article en_US

Files in this item

Files Size Format View Description
Betweenness Cen ... Some Classes of Graphs.pdf 193.2Kb PDF View/Open pdf

This item appears in the following Collection(s)

Show simple item record

Search Dyuthi

Advanced Search


My Account