Study on Neighborhood Prime Labeling

Abstract

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 P_n and Splitting graph of K_1,n are discussed. Also discuss the neighborhood prime labeling in Ring sum of cycle C_n and K_1,n and some graph operations on the Fan graph and Friendship graph.