Let G be a (p, q)-graph in which the edges are labeled 1, 2, . . . , q. The vertex sum for a vertex v is the sum of the labels of the incident edges at v. If the vertex sums are constant, modulo k, where k>= 2, then G is said to be Mod(k)-edge-magic. When k = p, Mod(p)-edge-magic graph is the edge-magic graph which was introduced by the Lee, Seah and Tan in [9]. In this paper we investigate graphs which are Mod(3)-edge-magic.DOI : http://dx.doi.org/10.22342/jims.0.0.81.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.