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