
In this paper we discuss about Near product cordial labeling graphs on path graph and its corollary then < Cn : Cn-1 > , S(Cn). If the labeling in the graph satisfies the condition of Near product cordial then it is called Near product cordial graphs.In this paper we have proved that the above mentioned graphs are Near product cordial graphs and except (S(Cn)) which is Weak Near product cordial labeling of the graph.