Representing an edge gcd from an incident vertex
ProvedKnodelPrimeCordial.incident_edge_label_repr__p2m_df77e916_fdac_4de2_9395_a46d11d6721f_a1graph-labelingknodel-graphp2o-gran-per-chapterp2o-plan-paperp2o-v1prime-cordial
For an edge of a finite simple graph and either of its incident vertices, there is an other endpoint whose label represents the edge gcd; the endpoint labels differ and the other label remains in 1,…,8 under the given bijection.
Preamble
import Mathlib import Definitions.Def_KnodelPrimeCordial_IsPrimeCordialLabeling
Formal statement
theorem KnodelPrimeCordial.incident_edge_label_repr__p2m_df77e916_fdac_4de2_9395_a46d11d6721f_a1 {V : Type*} [Fintype V] [DecidableEq V] (G : SimpleGraph V) [DecidableRel G.Adj] (f : V → ℕ) (hbij : Set.BijOn f Set.univ (Set.Icc 1 8)) (e : Sym2 V) (he : e ∈ G.edgeFinset) (v : V) (hv : v ∈ e) : ∃ w : V, KnodelPrimeCordial.edgeGcd f e = Nat.gcd (f v) (f w) ∧ f v ≠ f w ∧ f w ∈ Set.Icc 1 8 := by sorrySource
Haque, Khanam, Shahriar, Prime cordial labeling of Knödel graph, manuscript (2026) (held version, sha256 366502170d8d7c65ccc2fcc6f5373dac872d6efdc838ba9e671eb578e4c08c60), Lemma 2.1, p.3 (PDF p.3)