On Completely k-Magic Regular Graphs

• المؤلفون الرئيسيون: Eniego, Arnold A, Garces, Ian June L
• التنسيق: text
• منشور في: Archīum Ateneo 2015
• الموضوعات: : k-magic graphs; completely k-magic graphs; Hamiltonian decomposition; h-factorable; Mathematics
• الوصول للمادة أونلاين: https://archium.ateneo.edu/mathematics-faculty-pubs/51; https://archium.ateneo.edu/cgi/viewcontent.cgi?article=1050&context=mathematics-faculty-pubs

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...