On the connectivity and the diameter of betweenness-uniform graphs
From MaRDI portal
Publication:6184309
DOI10.1016/j.dam.2023.08.017OpenAlexW3200952652MaRDI QIDQ6184309
Pavel Valtr, Aneta Pokorná, David Hartman
Publication date: 24 January 2024
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2023.08.017
Extremal problems in graph theory (05C35) Paths and cycles (05C38) Distance in graphs (05C12) Connectivity (05C40)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the connectivity and the diameter of betweenness-uniform graphs
- 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
- The hull number of a graph
- Efficient algorithms for updating betweenness centrality in fully dynamic graphs
- Betweenness centrality in some classes of graphs
- Practical graph isomorphism. II.
- On the sum of all distances in a graph or digraph
- Betweenness Centrality: Extremal Values and Structural Properties
- Community structure in social and biological networks
- More on betweenness-uniform graphs
- On betweenness-uniform graphs