<abstract><p>For a graph $ G $, we define a total $ k $-labeling $ \varphi $ is a combination of an edge labeling $ \varphi_e(x)\to\{1, 2, \ldots, k_e\} $ and a vertex labeling $ \varphi_v(x) \to \{0, 2, \ldots, 2k_v\} $, such that $ \varphi(x) = \varphi_v(x) $ if $ x\in V(G) $ and $ \varphi(x) = \varphi_e(x) $ if $ x\in E(G) $, then $ k = \, \mbox{max}\, \{k_e, 2k_v\} $. The total $ k $-labeling $ \varphi $ is an <italic>edge irregular reflexive $ k $-labeling</italic> of $ G $ if every two different edges $ xy $ and $ x^\prime y^\prime $, the edge weights are distinct. The smallest value $ k $ for which such labeling exists is called a <italic>reflexive edge strength</italic> of $ G $. In this paper, we focus on the edge irregular reflexive labeling of antiprism, convex polytopes $ \mathcal D_{n} $, $ \mathcal R_{n} $, and corona product of cycle with path. This study also leads to interesting open problems for further extension of the work.</p></abstract>