Narayana Prime Cordial Labeling of Cycle Related and Tree Related Graphs

Abstract

The Narayana prime cordial labeling of a graph GU,E is a process of assigning the binary numbers 0 and 1 to the edges satisfying the cordiality condition through a 11 function on U and an induced function on E. In this manuscript, we compute this labeling to certain cycle related graphs and tree related graphs viz. (i) ladder graph, (ii) wheel graph, (iii) fan graph, (iv) double star graph, (v) bistar graph and (vi) generalized star graph..