Edge irregular reflexive labeling of prisms and wheels

For a graph G we define k-labeling ρ such that the edges of G are labeled with integers {1, 2, . . . , k_e} and the vertices of G are labeled with even integers {0, 2, . . . , 2k_v}, where k = max{k_e, 2k_v}. The labeling ρ is called an edge irregular k-labeling if distinct edges have distinct weights, where the edge weight is defined as the sum of the label of that edge and the labels of its ends. The smallest k for which such labeling exist is called the reflexive edge strength of G. In this paper we give exact values of reflexive edge strength for prisms, wheels, baskets and fans.