Kumar, VimalVijayalakshmi, D.2021-11-042021-11-042019-08-01https://doi.org/10.31801/cfsuasmas.526518http://hdl.handle.net/20.500.12575/75883A vertex magic total labeling is a bijection from the union of the vertex set and edge set to the consecutive integers 1,2,3,....,v+e with the property that for every u in the vertex set, the sum of the label of u and the label of the edges incident with u is equal to k, for some constant k. In this paper, we establish the vertex magic labeling of some classes of graphs and provide some open problems related to it.enGraph labelingMiddle graphTotal graphArticle682133513402618-6470