Let G be an undirected, simple and connected graph with vertex set V (G) and egde set E(G). An edge irregular reflexive k-labeling f is labeling such that edges labeled with integers number 1, 2, ..., ke and vertices labeled ...