Resumen de Hypo-k-Totally Magic Cordial Labeling of Graphs

P. Jeyanthi, N. Angel Benseera, Gee Gee Lau

• A graph G is said to be hypo-k-totally magic cordial if G — {v} is k-totally magic cordial for each vertex v in V(G). In this paper, we establish that cycle, complete graph, complete bipartite graph and wheel graph admit hypo-k-totally magic cordial labeling and some families of graphs do not admit hypo-k-totally magic cordial labeling.