Assume that G is a connected, undirected, simple graph with V (G) as its vertex set and E(G) as its edge set. A labeling technique known as edge irregular reflexive labeling allows each vertex to have a label that is a ...