On Mod(2)-edge-magic graphs
Chopra, Dharam V. Dios, R. Lee, Sin Min
Chopra, Dharam V.
Dios, R.
Lee, Sin Min
Citations
Altmetric:
Authors
Other Names
Location
Time Period
Advisors
Original Date
Digitization Date
Issue Date
2011-08-31
Type
Article
Genre
Keywords
(p,p+1)-graph,Mod(k)-edge-magic,Trees,Unicyclic
Subjects (LCSH)
Citation
Dharam Chopra, Rose Dios, Sin-Min Lee. On Mod(2)-Edge-Magic Graphs[J], Journal of Combinatorial Mathematics and Combinatorial Computing, Volume 078. 323-339.
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.
Table of Contents
Description
This is an open access article under the CC by license.
Publisher
Charles Babbage Research Centre
Journal
Journal of Combinatorial Mathematics and Combinatorial Computing
Book Title
Series
Digital Collection
Finding Aid URL
Use and Reproduction
Archival Collection
PubMed ID
DOI
ISSN
08353026