Abstract
The Narayana prime cordial labeling of a graph GU,E is a process of assigning the binary numbers 0 and 1 to the edges satisfying the cordiality condition through a 11 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..
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have