Bi Conditional Cordial Labeling of Some Duplicate Mirror Graphs

Abstract

A graph G with vertex set V consisting of p vertices and edge set E consisting of q edges is said to be Bicondtional cordial labelling if there exists a function  such that the induced edge labeling is   for   satisfying the condtion In this paper we construct and studyon the duplicate of Mirror graphs of even Path , Even Cycle , Even Ladder graph , Bi star graph B(m,n), where m and n are even and prove that they are Bioconditonal cordial labeling graph.