Super edge-magic labelings of some graphs

Abstract

A super edge-magic labeling on a graph G with the vertex-set V(G) and the edge-set E(G) is a one-to-one function f from V(G) U E(G) onto the set {1,2,…,p+q} where p= /V(G)/ และ q= /E(G)/ with the property that, for any edge ab, f(a) + f(ab) + f(b) = k for some k and f(V(G)) = {1,2,…,p} This thesis surveys and collects many classes of graphs that can admit a super edge-magic labeling. Moreover, we prove that the following graphs are super edge-magic: the (n,1)-kite when n is odd, the (n,m)-pineapple when n is odd, the disjoint union of n copies of (n,1)-kite, when n is odd and the disjoint union of K[subscript1,n] and K[subscript1,n+1].