On the integer-magic spectra of tessellation graphs.
Richard M. Low, Sin-Min Lee · 2006
Abstract. Let A be an abelian group with non-identity elements A ∗. A graph is A-magic if it has an edge-labeling by elements of A ∗ which induces a constant vertex labeling of the graph. In this paper we determine, for certain classes of triominoes and polyominoes, for which values of k ≥ 2 the graphs are Zk-magic. 1.