Cordial labeling of Butterfly and Enhanced Butterfly Networks

Abstract

Let G = (V, E) is a graph with vertex set V and edge set E.A vertex labeling  induces an edge labeling defined by . For  let  and  be the number of vertices v and edges e with  and , respectively. A graph G is cordial if there exists a vertex labeling such that  and . The cordial labeling of butterfly and enhanced butterfly networks are studied in this paper.