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, we investigate neighborhood prime labeling of graph obtained by identifying any two vertices of path Pn. We also discuss neighborhood prime labeling in some graph operations on the cycle Cn.