On Completely k-Magic Regular Graphs
Let k be a positive integer. A graph G = (V (G), E(G)) is said to be k-magic if there is a function (or edge labeling) ` : E(G) → Zk \ {0}, where Z1 = Z, such that the induced function (or vertex labeling) ` + : V (G) → Zk, defined by ` +(v) = P uv∈E(G) `(uv), is a constant map, where the sum is tak...
Saved in:
Main Authors: | Eniego, Arnold A, Garces, Ian June L |
---|---|
Format: | text |
Published: |
Archīum Ateneo
2015
|
Subjects: | |
Online Access: | https://archium.ateneo.edu/mathematics-faculty-pubs/51 https://archium.ateneo.edu/cgi/viewcontent.cgi?article=1050&context=mathematics-faculty-pubs |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
The null set of the join of paths
by: Eniego, Arnold A, et al.
Published: (2019) -
Super edge-magic labelings of some graphs
by: Wannaporn Sanprasert
Published: (2010) -
Super edge-magic labelings of some graphs
by: Wannaporn Sanprasert
Published: (2002) -
Super vertex-magic total labelings of some graphs
by: Pongpat Patarakitvanit
Published: (2007) -
Some super edge-magic graphs
by: Adthasit Sinna
Published: (2011)