Constructions of betweenness-uniform graphs from trees

05/14/2021
by   David Hartman, et al.
0

Betweenness centrality is a measure of the importance of a vertex x inside a network based on the fraction of shortest paths passing through x. We study a blow-up construction that has been shown to produce graphs with uniform distribution of betweenness. We disprove the conjecture about this procedure's universality by showing that trees with a diameter at least three cannot be transformed into betweenness-uniform by the blow-up construction. It remains open to characterize graphs for which the blow-up construction can produce betweenness-uniform graphs.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/22/2021

On the Connectivity and the Diameter of Betweenness-Uniform Graphs

Betweenness centrality is a centrality measure based on the overall amou...
research
10/01/2018

Towards Cereceda's conjecture for planar graphs

The reconfiguration graph R_k(G) of the k-colourings of a graph G has as...
research
06/06/2023

Infinite families of k-vertex-critical (P_5, C_5)-free graphs

A graph is k-vertex-critical if χ(G)=k but χ(G-v)<k for all v∈ V(G). We ...
research
06/09/2021

B1-EPG representations using block-cutpoint trees

In this paper, we are interested in the edge intersection graphs of path...
research
06/24/2022

A transient equivalence between Aldous-Broder and Wilson's algorithms and a two-stage framework for generating uniform spanning trees

The Aldous-Broder and Wilson are two well-known algorithms to generate u...
research
04/10/2019

Combinatorial constructions of intrinsic geometries

A generic method for combinatorial constructions of intrinsic geometrica...
research
01/25/2023

Construction of Uniform Designs over Continuous Domain in Computer Experiments

The construction of uniform designs (UDs) has received much attention in...

Please sign up or login with your details

Forgot password? Click here to reset