graph_vertex_dist_sum
def
For a vertex u in a finite simple graph G on vertex type V, graph_vertex_dist_sum G u is the sum ∑ v : V, G.dist u v of shortest-path distances from u to all vertices v of G.
Statement
noncomputable def graph_vertex_dist_sum {V : Type*} [Fintype V] (G : SimpleGraph V) (u : V) : ℕ
- Defined in
- arXiv:2611.12781, Section 2, equation (169)
- Verified
- 13 Nov 2026
- Axioms
- none listed
- Used by 1
- tauFor a vertex u in a finite simple graph G on vertex type V, tau G u is the integer (max_induced_linear_forest G : ℤ) * ((Fintype.card V :…
Read back from the Lean
Given a finite type V, a simple graph G with vertex type V, and a vertex u : V, graph_vertex_dist_sum G u is defined as the sum over all vertices v : V of the graph distance G.dist u v from u to v.
Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.
Lean source view module on GitHub
/-- The sum of shortest-path distances from vertex u to all vertices in G. -/ noncomputable def graph_vertex_dist_sum {V : Type*} [Fintype V] (G : SimpleGraph V) (u : V) : ℕ := ∑ v : V, G.dist u v