Summary: Let \(G\) be a connected, simple and undirected graph. The assignments \(\{0, 2, \dots, 2k_{v}\}\) to the vertices and \(\{1, 2, \dots, k_{e}\}\) to the edges of graph \(G\) are called total \(k\)-labelings, where \(k = \max\{k_e, 2k_{v}\}\). The total \(k\)-labeling is called an reflexive edge irregular \(k\)-labeling of the graph \(G\), if for every two different edges \(xy\) and \(x^\prime y^\prime\) of \(G\), one has \[ wt(xy)=f_{v}(x)+f_{e}(xy)+f_{v}(y) \neq wt(x^\prime y^\prime) = f_{v}(x^\prime) + f_{e}(x^\prime y^\prime) + f_{v}(y^\prime). \] The minimum \(k\) for which the graph \(G\) has an reflexive edge irregular \(k\)-labeling is called the reflexive edge strength of \(G\). In this paper we investigate the exact value of reflexive edge strength for generalized prism graphs.