tree_degree_sq_sum
def
For any finite type V and simple graph G on V with decidable adjacency, tree_degree_sq_sum G is the integer (with codomain ℤ) defined as the sum over all vertices v : V of the square of the vertex degree G.degree v cast to ℤ: ∑ v : V, (G.degree v : ℤ) ^ 2.
Statement
def tree_degree_sq_sum {V : Type*} [Fintype V] (G : SimpleGraph V) [DecidableRel G.Adj] : ℤ
- Defined in
- arXiv:2609.20390
- Verified
- 14 Nov 2026
- Axioms
- none listed
- Used by 1
- tree_katz_ising_FFor any finite simple graph G on a vertex type V with decidable equality and adjacency, tree_katz_ising_F G is the integer invariant F(G)…
Read back from the Lean
Given a finite type V and a simple graph G on V with decidable adjacency, tree_degree_sq_sum G is defined as the sum over all vertices v : V of the square of the degree of v in G, evaluated in ℤ.
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
/-- Sum of squared vertex degrees of a simple graph cast to the integers (first Zagreb index D(G)). -/ def tree_degree_sq_sum {V : Type*} [Fintype V] (G : SimpleGraph V) [DecidableRel G.Adj] : ℤ := ∑ v : V, (G.degree v : ℤ) ^ 2