Open AccessNarayana Prime Cordial Labeling of Complete Graph and Complete Bipartite Graph
Author(s) -
S. Venkatesh,
B. J. Balamurugan
Publication year - 2019
Publication title -
international journal of engineering and advanced technology
Language(s) - English
Resource type - Journals
ISSN - 2249-8958
DOI - 10.35940/ijeat.a1068.1291s319
Subject(s) - bipartite graph , combinatorics , discrete mathematics , mathematics , complete bipartite graph , graph , line graph , computer science
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.