Search arXivSearch

arXiv · 2607.04878

Steinerberger Curvature On Digraphs -- Discrete Bonnet-Myers and Lichnerowicz Theorems

Abstract

Steinerberger curvature encodes the global distance geometry of a graph through an equilibrium measure. In this paper, we derive explicit curvature formulas for undirected Cayley graphs of dihedral groups $D_n$ and generalized quaternion groups $Q_{4m}$. We then extend Steinerberger curvature to strongly connected simple digraphs by introducing in-curvature and out-curvature, reflecting the asymmetry of directed distances. For these directed curvatures, we establish structural properties, including negativity criteria and a permutation relation between in- and out-curvature. Our main results are directed analogues of the Bonnet--Myers, Cheng and Lichnerowicz theorems, together with reverse Bonnet--Myers inequalities for directed diameter and out-radius, and an upper bound for in-radius in terms of total curvature.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Kevin Fung, Johnny Lim. 2026-07-06. Steinerberger Curvature On Digraphs -- Discrete Bonnet-Myers and Lichnerowicz Theorems. https://arxiv.org/abs/2607.04878

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO