AFTD Auto-Formalizing Theoretical Domains

simple_graph_leaf_neighbor_count

def

The number of leaf neighbours (neighbours of degree one) of a vertex v; v is an l-stem when this number is l ≥ 1.

Statement

def simple_graph_leaf_neighbor_count {V : Type*} [Fintype V] [DecidableEq V]
    (G : SimpleGraph V) [DecidableRel G.Adj] (v : V) : ℕ
Defined in
arXiv:2610.11446 (On the local average order of dominating sets), Sec. 1 (leaf, stem, l-stem: a stem with l leaf neighbours).
Verified
09 Oct 2026
Axioms
none listed
Used by 11

Lean source view module on GitHub

/-- The number of leaf neighbours of `v` (neighbours of degree one): `v` is an `l`-stem when this is `l ≥ 1`. -/
def simple_graph_leaf_neighbor_count {V : Type*} [Fintype V] [DecidableEq V]
    (G : SimpleGraph V) [DecidableRel G.Adj] (v : V) : ℕ :=
  ((G.neighborFinset v).filter (fun u => G.degree u = 1)).card
See it in the graphDiscuss this resultChallenge it