Consecutive vertex names give edges of the Knödel graph
ProvedKnodelPrimeCordial.vtx_cycle_edgegraph-theoryknodel-graph
For even , every consecutive pair (indices modulo ) is adjacent in . This establishes the cycle edges in the paper’s cyclic description.
Preamble
import Mathlib import Definitions.Def_KnodelPrimeCordial_knodel import Definitions.Def_KnodelPrimeCordial_cyc import Definitions.Def_KnodelPrimeCordial_vtx
Formal statement
theorem KnodelPrimeCordial.vtx_cycle_edge (n : ℕ) (hn : Even n) (h8 : 8 ≤ n) (a b : Fin n) (hab : b.val = (a.val + 1) % n) :
(knodel 3 n).Adj (vtx n (by omega) a) (vtx n (by omega) b) := 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.