Study on Neighborhood Prime Labeling

A labeling or numbering of a graph G is an assignment of labels to the vertices of G that induces for each edge uv a labeling depending on the vertex labels f(u) and f(v). In this paper, neighborhood prime labeling of Star graph, Complete bipartite graph, Fan graph, Friendship graph, Flower graph, Bistar graph, Comb graph, splitting graph of Pn and Splitting graph of K1,n are discussed. Also discuss the neighborhood prime labeling in Ring sum of cycle Cn and K1,n and some graph operations on the Fan graph and Friendship graph.