The Knödel graph W₃,₈ has 12 edges
ProvedKnodelPrimeCordial.knodel_3_8_edge_count__p2m_730717b0_dc72_4b0f_b59f_ead0370cbb16_a1graph-labelingknodel-graphp2o-gran-per-chapterp2o-plan-paperp2o-v1prime-cordial
The graph knodel 3 8 has 12 undirected edges.
Preamble
import Mathlib import Definitions.Def_KnodelPrimeCordial_knodel
Formal statement
theorem KnodelPrimeCordial.knodel_3_8_edge_count__p2m_730717b0_dc72_4b0f_b59f_ead0370cbb16_a1 : (KnodelPrimeCordial.knodel 3 8).edgeFinset.card = 12 := by sorry
Source
Haque, Khanam, Shahriar, Prime cordial labeling of Knödel graph, manuscript (2026) (held version, sha256 366502170d8d7c65ccc2fcc6f5373dac872d6efdc838ba9e671eb578e4c08c60), Lemma 2.1, p.3 (PDF p.3)