Font Size: 

Abstract. Let G (V, E) be a simple graph consists of edges and vertices. A vertex-magic total labeling of a graph G is a bijective mapping of union edges and vertices to the integers {1, 2, 3, …, |V|+|E|}, such that there exists a positive integer k satisfying , for every and that adjacent with u. Then k is called a magic constant and G (V, E) is called vertex-magic total graph. Multicycle graph (mC_n) is an unconnected combination of m- cycle (C_n). The study is a literature study with a mathematical proof. The result of the study is multicycle graphs have a vertex-magic total labeling. This labeling can be done on multicycle with bound of magic constant is for some integers and . If the labels of vertices are {1, 2, 3, …, mn} then a strong vertex-magic total labeling can be done on this multicycle with magic constant is for odd integers and .