A simple graph admits an -covering if every edge in belongs to a subgraph of isomorphic to . We say that is -magic if there exists a total labeling such that for each subgraph of isomorphic to ,
is constant.
When , then is said to be -supermagic.
In this paper, we show that all prism graphs , except for , the ladder graph , and the grid , are -supermagic.