Each labeling block covers its twelve labels
ProvedKnodelPrimeCordial.labelF_block_cover__p2m_7c638a40_aa1b_4e3b_9a8c_79f3dcff308e_a1graph-labelingknodel-graphp2o-gran-per-chapterp2o-plan-paperp2o-v1prime-cordial
For every block number k and every offset t from 1 through 12, some index offset r below 12 in that block has label 12k+t.
Preamble
import Mathlib import Definitions.Def_KnodelPrimeCordial_labelF
Formal statement
theorem KnodelPrimeCordial.labelF_block_cover__p2m_7c638a40_aa1b_4e3b_9a8c_79f3dcff308e_a1 (k t : ℕ) (ht : t ∈ Set.Icc 1 12) : ∃ r : ℕ, r < 12 ∧ KnodelPrimeCordial.labelF (12 * k + r) = 12 * k + t := by sorry
Source
Haque, Khanam, Shahriar, Prime cordial labeling of Knödel graph, manuscript (2026) (held version, sha256 366502170d8d7c65ccc2fcc6f5373dac872d6efdc838ba9e671eb578e4c08c60), Lemma 2.3, p.3 (PDF p.3); proof pp.4–6