Odd order C4-face-magic m × n projective grid graphs having C4-face-magic value 2mn+1 or 2mn+3
Abstract
For a graph G = (V, E) embedded in the projective plane, let F(G) denote the set of faces of G. Then, G is called a Cn-face-magic projective graph if there exists a bijection f: V(G) \1, 2, …, |V(G)|\ such that for any F ∈ F(G) with F Cn, the sum of all the vertex labels around Cn is a constant S. We consider the m × n grid graph, denoted by Pm,n, embedded in the projective plane in the natural way. Let m ≥slant 3 and n ≥slant 3 be odd integers. It is known that the C4-face-magic value of a C4-face-magic labeling on Pm,n is either 2mn+1, 2mn+2, or 2mn+3. The characterization of C4-face-magic labelings on Pm,n having C4-face-magic value 2mn+2 is known. In this paper, we determine a category of C4-face-magic labelings on Pm,n for which the C4-face-magic value is either 2mn+1 or 2mn+3. It is conjectured that these are the only C4-face-magic labeling on Pm,n having C4-face-magic value 2mn+1 or 2mn+3.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.