randic_index
def
The Randić index of a finite simple graph G is the sum over all edges e in G of 1 / Real.sqrt (degree(u) * degree(v)) where e is the unordered pair of u and v.
Statement
noncomputable def randic_index {V : Type*} [Fintype V] (G : SimpleGraph V) : ℝ
- Defined in
- arXiv:2611.03879 Section 2.2
- Verified
- 05 Nov 2026
- Axioms
- none listed
- Used by 3
- op1012_complete_bipartite_randic_indexFor any positive integers a and b, the Randić index of the complete bipartite graph completeBipartiteGraph (Fin a) (Fin b) equals…
- randic_index_nonnegFor any finite simple graph G on a finite vertex type V, its Randić index is non-negative: 0 ≤ randic_index G.
- op1012_randic_index_le_half_cardFor any finite simple graph G on a finite vertex type V, its Randić index is at most half the number of vertices: randic_index G ≤…
Read back from the Lean
Given a finite type V and a simple graph G on V, randic_index G is defined as the real number given by the sum over all edges e = {u, v} in G.edgeFinset of 1 / Real.sqrt ((G.degree u : ℝ) * (G.degree 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 Randić index of a finite simple graph G is the sum over its edges of 1 / sqrt(d(u) * d(v)). -/ noncomputable def randic_index {V : Type*} [Fintype V] (G : SimpleGraph V) : ℝ := open scoped Classical in ∑ e ∈ G.edgeFinset, Sym2.lift ⟨fun u v => 1 / Real.sqrt ((G.degree u : ℝ) * (G.degree v : ℝ)), by intro u v simp [mul_comm]⟩ e