Pelabelan Super Vertex Magic

Abstract

Super vertex magic labeling is labeling on graph with is a set of edges mapped into and is a set of vertices mapped into . It has a vertex magic labeling in which and represents the size and order of the graph respectively. This manuscript proves that paths, cyclics, and disjoint union of cyclics have a super vertex magic labeling. There are four theorems to be discussed. The first theorem proves that path is super vertex magic if and only if is odd and . The second theorem proves that cyclic is super vertex magic if and only if is odd. The third theorem proves that bijection function from an edge set onto of graph can be extended to a super vertex magic labeling if and only if the set amount of edge label that incidents with a vertex in the graph, consists of sequential integers as many as vertices in the graph. The fourth theorem proves that disjoint union of the cyclics consists of cyclics with each cyclic has vertices is super vertex magic if and only if and are odd.