Abstract
Complete bipartite graph and complete graph are very important graphs and they find vital applications in the field of computer science. In this paper we compute the labels 0 and 1 to the edges of these graphs by satisfying the cordiality condition using prime numbers and Narayana numbers. We use divisibility concepts while computing the NP-cordial graphs.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Engineering and Advanced Technology
Paper Title
Journal
Date
