On Edge Irregular Reflexive Labeling for Generalized Prism

Among the various ideas that appear while studying graph theory, which has gained much attraction especially in graph labeling, labeling of graphs gives mathematical models which value for a vast range of applications in high technology (data security, cryptography, various problems of coding theory, astronomy, data security, telecommunication networks, etc.). A graph label is a designation of graph elements, i.e., the edges and/or vertex of a group of numbers (natural numbers), and is called assignment or labeling. The vertex or edge labeling is related to their domain asset of vertices or edges. Likewise, for total labeling, we take the domain as vertices and edges both at the same time. The reflexive edge irregularity strength (res) is total labeling in which weights of edges are not the same for all edges and the weight of an edge is taken as the sum of the edge labels and the vertices associated with that edge. In the res, the vertices are labeled with nonnegative even integers while the edges are labeled with positive integers. We have to make the labels minimum, whether they are associated with vertices or edges. If such labeling exists, then it is called the res of H and is represented as s res(H). In this paper, we have computed the res for the Cartesian product of path and cycle graph which is also known as generalizing prism.