A simple graph is called -magic if there is a labeling , where is an Abelian group and , such that the induced vertex labeling , defined as , for every , is a constant in . In this paper, we show constructions of new classes of -magic graphs from known -magic graphs using labeling matrices.