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 |
---|---|
格式: | text |
出版: |
Archīum Ateneo
2016
|
主題: | |
在線閱讀: | https://archium.ateneo.edu/mathematics-faculty-pubs/54 https://archium.ateneo.edu/cgi/viewcontent.cgi?article=1053&context=mathematics-faculty-pubs |
標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
相似書籍
-
On Completely k-Magic Regular Graphs
由: Eniego, Arnold A, et al.
出版: (2015) -
REGULAR MAGIC GRAPH
由: WANG SONGYU
出版: (2021) -
VERTEX-MAGIC REGULAR GRAPHS
由: TANG WANWEI SHERYL
出版: (2021) -
On distance-regular graphs and (s,c,a,k)-graphs
由: Bautista, Lincoln A.
出版: (1998) -
The null set of the join of paths
由: Eniego, Arnold A, et al.
出版: (2019)