Author: Hartman, David; Pokorn'a, Aneta; Valtr, Pavel
Title: On the Connectivity and the Diameter of Betweenness-Uniform Graphs Cord-id: cuqs2y4q Document date: 2021_9_22
ID: cuqs2y4q
Snippet: Betweenness centrality is a centrality measure based on the overall amount of shortest paths passing through a given vertex. A graph is betweenness-uniform if all its vertices have the same betweenness centrality. We study the properties of betweenness-uniform graphs. In particular, we show that every connected betweenness-uniform graph is either a cycle or a $3$-connected graph. Also, we show that betweenness uniform graphs of high maximal degree have small diameter.
Document: Betweenness centrality is a centrality measure based on the overall amount of shortest paths passing through a given vertex. A graph is betweenness-uniform if all its vertices have the same betweenness centrality. We study the properties of betweenness-uniform graphs. In particular, we show that every connected betweenness-uniform graph is either a cycle or a $3$-connected graph. Also, we show that betweenness uniform graphs of high maximal degree have small diameter.
Search related documents:
Co phrase search for related documents- Try single phrases listed below for: 1
Co phrase search for related documents, hyperlinks ordered by date