Totally Magic Labelings
W. D. Wallis · Birkhäuser Boston eBooks · 2001
In this chapter we investigate the question: for a graph G does there exist a total labeling λ that is both edge-magic and vertex-magic? As we said, such a λ is called a totally magic labeling and G is a totally magic graph. The constants h and k are the magic constant and magic sum respectively. We do not require that h = k . These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.