zero_forcing_boundary
def
For a simple graph G and a subset X of vertices, the boundary ∂X is the set of all vertices x in X that have a neighbor outside X.
Statement
def zero_forcing_boundary {V : Type*} (G : SimpleGraph V) (X : Set V) : Set V
- Defined in
- arXiv:2611.13244, Definition 2.8 -- Stabilization of the zero forcing number of generalized Petersen graphs
- Verified
- 12 Nov 2026
- Axioms
- none listed
- Used by 3
- zero_forcing_boundary_monoLet G be a simple graph and S a finite subset of vertices. Then for every natural number i, the extended cardinality of the boundary…
- zero_forcing_boundary_monotonicityLet G be a simple graph, and let S be a finite subset of vertices. In the zero forcing sequence B_0 = S ⊆ B_1 ⊆ ..., the extended…
- zero_forcing_boundary_cl_leLet G be a simple graph and S a finite subset of vertices. Then the extended cardinality of the boundary of the closure cl(S) is at most…
Read back from the Lean
Given a type V, a simple graph G on V, and a subset X of V, zero_forcing_boundary G X is defined as the set of all vertices x ∈ X such that there exists a neighbor y of x in G with y ∉ X.
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 boundary of a vertex subset X in a graph G is the set of vertices in X with at least one neighbor outside X. -/ def zero_forcing_boundary {V : Type*} (G : SimpleGraph V) (X : Set V) : Set V := {x ∈ X | ∃ y ∈ G.neighborSet x, y ∉ X}