Pelabelan super edge magic pada graf cycle (P_2n(+)N_m), graf planar ((P_2 U k K_1)+N_m), graf jalinan, dan graf ubur-ubur

Abstract

Labeling in graph theory is a bijection mapping that maps each elements of a set of vertices and a set of edges to the set of natural number. A graph denoted by ( ( ) ( )) with p vertices and q edges is called a super edge magic if and only if there is a bijective function that maps each of vertices labels to the natural numbers range 1 to and each of edges labels to the natural numbers range to . Also, there is a constant so that the number of two adjacent vertices and one of edges is equal to . In this paper, there are one lemma and four theorems were discussed. The lemma proves that graph with super edge magic labeling has a set of edges that consists of consecutive integers. Each of the four theorems proves that cycle graph ( ( ) ), planar graph (( ) ), braid graph and jellyfish graph has super edge magic labeling. This was proved using the fact indicated in the lemma previously mentioned.