In graph theory we define the total labeling, such that the edge labels and vertex labels are positive integers and even integers respectively and for different edges we have distinct weights, whereas the weight of an edge is the sum of labels of that edge and adjacent vertices, then labeling is referred as edge irregular reflexive total labeling. In this paper we calculated the exact values of reflexive edge irregularity strength for mk-graph of path graph mPn for k = 1 with n ≥ 3, m ≥ 4.