Edge binary coding of Cayley network

Abstract

Let  =  is an algebraic network model of the Cayley graph. A binary coding edge function   : L(????) , it induces  as (  = ). The function  is said to be an edge cordial  function of , if the difference between the number of vertices (edges) labeled by zero and the number of vertices (edges) labeled by one is at most one. In this paper, we show the edge binary coding of the Cayley graph network model which satisfies the edge cordial constraint.