New Results on the (Super) Edge-Magic Deficiency of Chain Graphs

Let be a graph of order and size . An edge-magic labeling of is a bijection such that is a constant for every edge . An edge-magic labeling of with is called a super edge-magic labeling. Furthermore, the edge-magic deficiency of a graph , , is defined as the smallest nonnegative integer such that has an edge-magic labeling. Similarly, the super edge-magic deficiency of a graph , , is either the smallest nonnegative integer such that has a super edge-magic labeling or if there exists no such integer . In this paper, we investigate the (super) edge-magic deficiency of chain graphs. Referring to these, we propose some open problems.

from # All Medicine by Alexandros G. Sfakianakis via Alexandros G.Sfakianakis on Inoreader http://ift.tt/2t318dD
via IFTTT