On Steinerberger Curvature and Graph Distance Matrices

Abstract

Steinerberger proposed a notion of curvature on graphs involving the graph distance matrix (J. Graph Theory, 2023). We show that nonnegative curvature is almost preserved under three graph operations. We characterize the distance matrix and its null space after adding an edge between two graphs. Let $D$ be the graph distance matrix and $\mathbf{1}$ be the all-one vector. We provide a way to construct graphs so that the linear system $Dx = \mathbf{1}$ does not have a solution.