On the connectivity and the diameter of betweenness-uniform graphs

DOI10.1007/978-3-030-67899-9_26MaRDI QIDQ831737zbMATH OpenOpenAlexFDO

Authors David Hartman, Aneta Pokorná, Pavel Valtr

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)

Cites work

• A measure for a balanced workload and its extremal values
• Betweenness centrality in convex amalgamation of graphs
• Betweenness centrality in some classes of graphs
• Bounds and relations involving adjusted centrality of the vertices of a tree
• Centrality and betweenness: vertex and edge decomposition of the Wiener index
• Community structure in social and biological networks
• Efficient algorithms for updating betweenness centrality in fully dynamic graphs
• More on betweenness-uniform graphs.
• On betweenness-uniform graphs.
• On the sum of all distances in a graph or digraph
• Spectral bounds for the betweenness of a graph
• Towards a characterization of graphs with distinct betweenness centralities

Cited in

(2)

• On the connectivity and the diameter of betweenness-uniform graphs
• On the Connectivity and the Diameter of Betweenness-Uniform Graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q831737)