This paper is mainly devoted to generate (special)(super)
edge-magic labelings of graphs using matrices. Matrices are used
in order to find lower bounds for the number of non-isomorphic
(special)(super) edge-magic labelings of certain types of graphs.
Also new applications of graph labelings are discussed
