dominating_occupancy
def
The normalized lambda-biased dominating occupancy rho_G(lam) of a finite simple graph G on vertex set V is the sum over all dominating sets S of |S| * lam^{|S|} divided by |V| * Z_G(lam).
Statement
open Classical in noncomputable def dominating_occupancy {V : Type*} [Fintype V] (G : SimpleGraph V) (lam : ℝ) : ℝ
- Defined in
- arXiv:2208.10475v2; OP-542
- Verified
- 27 Oct 2026
- Axioms
- none listed
- Built on 2
- simple_graph_dominating_setsD(G): the dominating sets of G, i.e. the finite vertex sets S such that every vertex of G lies in S or is adjacent to a vertex of S.
- dominating_partition_functionThe dominating set partition function Z_G(lam) of a finite simple graph G is the sum over all dominating sets S of G of lam^{|S|}.
- Used by 1
- dominating_occupancy_one_eq_avg_dominating_order_div_cardAt activity lam = 1, the dominating occupancy equals the average dominating set order divided by the number of vertices.
Read back from the Lean
Given a finite type V, a simple graph G on V, and a real number lam (λ), dominating_occupancy G lam is defined as the real number:
(∑ S ∈ simple_graph_dominating_sets G, |S| * lam^|S|) / (|V| * dominating_partition_function G lam)
that is, the sum over all dominating sets S of G of |S| * lam^|S|, divided by the product of the number of vertices |V| and the dominating set partition function of G at lam.
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
open Classical in /-- The normalized lambda-biased dominating occupancy rho_G(lam) of a finite simple graph G. -/ noncomputable def dominating_occupancy {V : Type*} [Fintype V] (G : SimpleGraph V) (lam : ℝ) : ℝ := (∑ S ∈ simple_graph_dominating_sets G, (S.card : ℝ) * lam ^ S.card) / ((Fintype.card V : ℝ) * dominating_partition_function G lam)