Edges outside the named cycle are exactly the even-index chords
ProvedKnodelPrimeCordial.vtx_adj_off_cyclegraph-theoryknodel-graph
Let be even, and let be indices that are not consecutive in either cyclic direction. Then and are adjacent in if and only if they are distinct and either is even with , or is even with . This identifies precisely the edges remaining after the cycle edges are removed.
Preamble
import Mathlib import Definitions.Def_KnodelPrimeCordial_knodel import Definitions.Def_KnodelPrimeCordial_cyc import Definitions.Def_KnodelPrimeCordial_vtx
Formal statement
theorem KnodelPrimeCordial.vtx_adj_off_cycle (n : ℕ) (hn : Even n) (h8 : 8 ≤ n) (a b : Fin n) (hab : b.val ≠ (a.val + 1) % n)
(hba : a.val ≠ (b.val + 1) % n) :
(knodel 3 n).Adj (vtx n (by omega) a) (vtx n (by omega) b) ↔
a ≠ b ∧ ((Even a.val ∧ b.val = (a.val + 5) % n) ∨
(Even b.val ∧ a.val = (b.val + 5) % n)) := by sorrySource
Haque, Khanam, Shahriar, Prime cordial labeling of Knödel graph, manuscript (2026), §1 p.3, cyclic edge-set display. Supporting lemma extracted from the cyclic_model milestone.