On the connectivity and the diameter of betweenness-uniform graphs

DOI10.1007/978-3-030-67899-9_26OpenAlexW3126148606MaRDI QIDQ831737

Pavel Valtr, David Hartman, Aneta Pokorná

Publication date: 24 March 2022

Full work available at URL: https://arxiv.org/abs/2109.10594

zbMATH Keywords

distanceconnectivitybetweenness centralitybetweenness-uniform

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Related Items (1)

On the connectivity and the diameter of betweenness-uniform graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Spectral bounds for the betweenness of a graph
• Bounds and relations involving adjusted centrality of the vertices of a tree
• A measure for a balanced workload and its extremal values
• Efficient algorithms for updating betweenness centrality in fully dynamic graphs
• Betweenness centrality in some classes of graphs
• On the sum of all distances in a graph or digraph
• Community structure in social and biological networks
• More on betweenness-uniform graphs
• On betweenness-uniform graphs

This page was built for publication: On the connectivity and the diameter of betweenness-uniform graphs