On Mod(2)-edge-magic graphs

Document Type

Article

Publication Date

8-1-2011

Abstract

Let G be a (p,q)-graph where each edge of G is labeled by a number 1,2,⋯,q without repetition. The vertex sum for a vertex v is the sum of the labels of edges that are incident to v. If the vertex sums equal to a constant (mod k) where k ≥ 2, then G is said to be Mod(k)-edge-magic. In this paper we investigate graphs which are Mod(k)-edge-magic. When k =p, the corresponding Mod(p)-edge-magic graph is the edge-magic graph introduced by Lee (third author), Seah and Tan in [10]. In this work we investigate trees, unicyclic graphs and (p,p+1)-graphs which are Mod(2)-edge-magic.

Identifier

79960822435 (Scopus)

Publication Title

Journal of Combinatorial Mathematics and Combinatorial Computing

ISSN

08353026

First Page

323

Last Page

339

Volume

78

This document is currently not available here.

Share

COinS