2022/09/30 by Florentin Münch, Münch, Florentin · 1 citation
Mathematics · #Combinatorics (math.CO) #Differential Geometry (math.DG) #FOS: Mathematics #Geometric Analysis and Curvature Flows #Geometry and complex manifolds
paper · pdf · doi:10.48550/arxiv.2209.15564
openalex publication_date 2022/09/30 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We give a new upper bound for the average graph distance in terms of the average Ollivier curvature. Here, the average Ollivier curvature is weighted with the edge betweenness centrality. Moreover, we prove that equality is attained precisely for the reflective graphs which have been classified as Cartesian products of cocktail party graphs, Johnson graphs, halved cubes, Schläfli graphs, and Gosset graphs.