Edge-magic total labeling algorithm and its application

Let G be a simple connected graph with p vertices and q edges, there exists a bijective function f from $V(G)UE(G)$ to the integers 1,2,..., $p+q$, such that the sum of any edge label and its incident vertex labels is equal to a constant k, f is called an edge-magic total labeling(EMTL for short) while k is magic constant. In this paper, an edge-magic total labeling algorithm (EMTL algorithm for short) is designed, which has a lot of graphics processing capabilities. Several complex research problems in some open literatures can be solved easily and effectively.