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
- simple_graph_star_like_deletion_number_le_cardFor every finite simple graph G, deleting all vertices leaves the empty graph, which is star-like, so the star-like deletion number d_*(G)…
- simple_graph_local_avg_dominating_order_eq_four_mul_add_one_of_universalRigidity in the universal-vertex regime: if G has no isolated vertices, v is adjacent to every other vertex (deg v = n − 1), and avd_v(G)…
- simple_graph_is_star_like_complete_twoK₂ is star-like.
- simple_graph_leaf_neighbor_count_complete_twoIn K₂, each vertex has exactly one leaf neighbour.
- simple_graph_local_avg_dominating_order_stem_le_of_card_twoThe target statement at order n = 2: if |V| = 2 and G has no isolated vertices, then for every vertex v, avd_v(G) = (4·2+1)/6, v has…
- simple_graph_is_star_likeG is star-like: every vertex is either a leaf (degree one) or an l-stem with 1 ≤ l ≤ 2.
- dominating_average_stability_path_five_deletionThe minimum star-like vertex deletion distance of the five-vertex path is exactly1.
- dominating_average_stability_path_five_delete_endpointDeleting an endpoint from the five-vertex path leaves a star-like induced graph.
- dominating_average_stability_path_five_not_starThe five-vertex path is not star-like.
- not_simple_graph_is_star_like_complete_threeK₃ is not star-like (no vertex is a leaf or has a leaf neighbour).
- simple_graph_star_like_deletion_number_eq_zero_of_star_likeIf a finite simple graph G is star-like, its star-like deletion number d_*(G) is zero.
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