Betweenness centrality in some classes of graphs
From MaRDI portal
Publication:2019271
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.
Recommendations
Cites work
- scientific article; zbMATH DE number 3445271 (Why is no real title available?)
- scientific article; zbMATH DE number 3290993 (Why is no real title available?)
- A characterization of hypercubes
- Generalized line graphs
- Interval-regular graphs
- On betweenness-uniform graphs.
- Recursively constructible families of graphs
Cited in
(36)- The stress of a graph
- scientific article; zbMATH DE number 7708854 (Why is no real title available?)
- Further results on betweenness centrality of graphs
- Spectral bounds for the degree of betweenness of a graph
- HARMONIC CENTRALIZATION OF SOME GRAPH FAMILIES
- Towards a characterization of graphs with distinct betweenness centralities
- BETWEENNESS CENTRALIZATION FOR BIPARTITE GRAPHS
- Betweenness centrality of some special product of graphs (rooted, cluster and coronal)
- Betweenness centrality in Cartesian product of graphs
- Betweenness Centrality: Extremal Values and Structural Properties
- On the connectivity and the diameter of betweenness-uniform graphs
- Betweenness centers in interval graphs
- Betweenness centrality in Cartesian product of graphs
- Alpha current flow betweenness centrality
- Paths and flows for centrality measures in networks
- Betweenness centrality in convex amalgamation of graphs
- scientific article; zbMATH DE number 6096696 (Why is no real title available?)
- A centrality notion for graphs based on Tukey depth
- scientific article; zbMATH DE number 2170478 (Why is no real title available?)
- scientific article; zbMATH DE number 6863841 (Why is no real title available?)
- Centrality measure in graphs
- Betweenness centers of tournaments
- On the betweenness centrality of Petersen graph \(GP(n,2)\)
- Extremal graphs with respect to vertex betweenness centrality for certain graph families
- A breadth-first search with betweenness
- CLOSENESS CENTRALITY IN GRAPH PRODUCTS
- Determination of the importance of vertices in a graph
- Betweenness centrality profiles in trees
- Bounds and relations involving adjusted centrality of the vertices of a tree
- On the connectivity and the diameter of betweenness-uniform graphs
- Hardness of bounding influence via graph modification
- Notes on the betweenness centrality of a graph
- Measuring vertex centrality using the Holevo quantity
- Intersecting geodesics and centrality in graphs
- Classroom notes: betweenness centrality in fiber-optic networks
- Centrality betweenness in some join of graphs
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)
