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
標簽: 添加標簽
沒有標簽, 成為第一個標記此記錄!