Totally magic cordial deficiency of some GRAPHS

Abstract

A graph G is said to have a totally magic cordial labeling with constant C if there exists a mapping f : V(G) U E(G) → {0,1} such that f(a) + f(b) + f(ab) = C (mod 2) for all ab ϵ E(G) and |nf(0) - nf(l)| ≥ 1, where nf(i) (i = 0,1) is the sum of the number of vertices and edges with label i. The totally magic cordial deficiency of a graph G, denoted by μt(G), is min{|nf(0) - nf(l)| - 1}. In this paper, we study the totally magic cordial deficiency of some graphs. © 2017 Utilitas Mathematica Publishing Inc.. All rights reserved.