Cartesian Magicness of 3-Dimensional Boards

Authors Gee-Choon Lau, Ho Kuen Ng, Wai Chee Shiu

Publication date 13 May 2018

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Abstract: A

(p, q, r)

-board that has

p q + p r + q r

squares consists of a

(p, q)

-, a

(p, r)

-, and a

(q, r)

-rectangle. Let

S

be the set of the squares. Consider a bijection

f : S o [1, p q + p r + q r]

. Firstly, for

1 l e i l e p

, let

x_{i}

be the sum of all the

q + r

integers in the

i

-th row of the

(p, q + r)

-rectangle. Secondly, for

1 l e j l e q

, let

y_{j}

be the sum of all the

p + r

integers in the

j

-th row of the

(q, p + r)

-rectangle. Finally, for

1 l e k l e r

, let

z_{k}

be the the sum of all the

p + q

integers in the

k

-th row of the

(r, p + q)

-rectangle. Such an assignment is called a

(p, q, r)

-design if

x_{i} : 1 l e i l e p = c_{1}

for some constant

c_{1}

,

y_{j} : 1 l e j l e q = c_{2}

for some constant

c_{2}

, and

z_{k} : 1 l e k l e r = c_{3}

for some constant

c_{3}

. A

(p, q, r)

-board that admits a

(p, q, r)

-design is called (1) Cartesian tri-magic if

c_{1}

,

c_{2}

and

c_{3}

are all distinct; (2) Cartesian bi-magic if

c_{1}

,

c_{2}

and

c_{3}

assume exactly 2 distinct values; (3) Cartesian magic if

c_{1} = c_{2} = c_{3}

(which is equivalent to supermagic labeling of

K (p, q, r)

). Thus, Cartesian magicness is a generalization of magic rectangles into 3-dimensional space. In this paper, we study the Cartesian magicness of various

(p, q, r)

-board by matrix approach involving magic squares or rectangles. In Section~2, we obtained various sufficient conditions for

(p, q, r)

-boards to admit a Cartesian tri-magic design. In Sections~3 and~4, we obtained many necessary and (or) sufficient conditions for various

(p, q, r)

-boards to admit (or not admit) a Cartesian bi-magic and magic design. In particular, it is known that

K (p, p, p)

is supermagic and thus every

(p, p, p)

-board is Cartesian magic. We gave a short and simpler proof that every

(p, p, p)

-board is Cartesian magic.

This page was built for publication: Cartesian Magicness of 3-Dimensional Boards

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6301510)