Characterization of completely k-magic regular graphs
Let k ∈ N and c ∈ Zk. A graph G is said to be c-sum k-magic if there is a labeling ` : E(G) → Zk \ {0} such that P u∈N(v) `(uv) ≡ c (mod k) for every vertex v of G, where N(v) is the neighborhood of v in G. We say that G is completely k-magic whenever it is c-sum k-magic for every c ∈ Zk. In this pa...
Saved in:
Main Authors: | Eniego, Arnold A, Garces, Ian June L |
---|---|
Format: | text |
Published: |
Archīum Ateneo
2016
|
Subjects: | |
Online Access: | https://archium.ateneo.edu/mathematics-faculty-pubs/54 https://archium.ateneo.edu/cgi/viewcontent.cgi?article=1053&context=mathematics-faculty-pubs |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Ateneo De Manila University |
Similar Items
-
On Completely k-Magic Regular Graphs
by: Eniego, Arnold A, et al.
Published: (2015) -
REGULAR MAGIC GRAPH
by: WANG SONGYU
Published: (2021) -
VERTEX-MAGIC REGULAR GRAPHS
by: TANG WANWEI SHERYL
Published: (2021) -
On distance-regular graphs and (s,c,a,k)-graphs
by: Bautista, Lincoln A.
Published: (1998) -
The null set of the join of paths
by: Eniego, Arnold A, et al.
Published: (2019)