Betweenness centrality in some classes of graphs (Q2019271)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Betweenness centrality in some classes of graphs |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Betweenness centrality in some classes of graphs |
scientific article |
Statements
Betweenness centrality in some classes of graphs (English)
0 references
27 March 2015
0 references
Summary: 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.
0 references
centrality measures
0 references
real-world networks
0 references
0.8495273590087891
0 references
0.8443030714988708
0 references
0.8335592746734619
0 references
