Characterization of Completely $k$-Magic Regular Graphs
Combinatorics
2017-11-22 v1
Abstract
Let and , where . A graph is said to be -sum -magic if there is a labeling such that for every vertex of , where is the neighborhood of in . We say that is completely -magic whenever it is -sum -magic for every . In this paper, we characterize all completely -magic regular graphs.
Keywords
Cite
@article{arxiv.1606.04461,
title = {Characterization of Completely $k$-Magic Regular Graphs},
author = {Arnold A. Eniego and I. J. L. Garces},
journal= {arXiv preprint arXiv:1606.04461},
year = {2017}
}
Comments
13 pages