Degree three for vertices on side zero
ProvedKnodelPrimeCordial.knodel_three_regular_side0__p2m_9dfa4dbf_1cc5_4722_9f1c_fa72524f7381_a2graph-labelingknodel-graphp2o-gran-per-chapterp2o-plan-paperp2o-v1prime-cordial
For even n at least 10, a vertex (0,j) has exactly three neighbors. Unfolding the graph definition gives the opposite-side indices j, j+1, and j+3 modulo n/2; the modulus is at least 5, so these indices are distinct. Counting this neighbor set establishes the degree.
Preamble
import Mathlib import Definitions.Def_KnodelPrimeCordial_knodel
Formal statement
theorem KnodelPrimeCordial.knodel_three_regular_side0__p2m_9dfa4dbf_1cc5_4722_9f1c_fa72524f7381_a2 (n : ℕ) (hn : Even n) (h10 : 10 ≤ n) (j : Fin (n / 2)) : (KnodelPrimeCordial.knodel 3 n).degree (0, j) = 3 := 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