Edges labelled in the cyclic model, residue class modulo
ProvedKnodelPrimeCordial.cyc_label_one_count_mod0graph-labelingknodel-graphprime-cordial
In residue class modulo twelve, exactly three quarters of the edges of the cyclic model receive label .
Let be a multiple of twelve and let be the labeling of the proof of Lemma 2.3. The cyclic model has cycle edges and chords, all indices read modulo . An edge receives label when . The claim is that
Role. The second half of the prime-cordiality condition in residue class ; with it gives .
Formalization Note The graph is cyc n on Fin n and the edge set is edgesLabelOne (cyc n) f, a Finset of unordered pairs.
Preamble
import Mathlib import Definitions.Def_KnodelPrimeCordial_IsPrimeCordialLabeling import Definitions.Def_KnodelPrimeCordial_cyc import Definitions.Def_KnodelPrimeCordial_labelF
Formal statement
namespace KnodelPrimeCordial
theorem cyc_label_one_count_mod0 (n : ℕ) (hn : 0 < n) (h12 : 12 ∣ n) :
(edgesLabelOne (cyc n) (fun i : Fin n => labelF i.val)).card = 3 * n / 4 := by sorry
end KnodelPrimeCordialSource
Haque, Khanam, Shahriar, Prime cordial labeling of Knödel graph, manuscript (2026), proof of Lemma 2.3, Case 1, pp.4-5