Additive Inverse Cordial Labeling of Graphs

Abstract

Let  be a  graph. Consider the function  from    to the set  and the induced surjective edge function  defined by . Let  and  respectively denote the number of vertices labelled by x, where , and number of edges labelled by , where . Then Ψ is said to be an additive inverse cordial labelingif , where  and . If G has an additive inverse cordial labeling Ψ then we say that G is an additive inverse cordial graph.