Research on Edge-Magic Total Labeling Algorithms of Several Joint Graphs

For a graph, the label numbers of points and edges can be mapped to, and the label value of any edge and its associated vertices is constant, then the graph is said to have edge-magic total labeling. This paper first obtains undirected simple connected graphs within sixteen points, and designs a new algorithm that can be used to determine whether the graph has edge-magic total labeling. Secondly, the labeling results of undirected simple connected graphs within 16 points are obtained, and several theorems are summarized and proved.