On Edge Irregular Reflexive Labeling of Categorical Product of Two Paths

Among the huge diversity of ideas that show up while studying graph theory, one that has obtained a lot of popularity is the concept of labelings of graphs. Graph labelings give valuable mathematical models for a wide scope of applications in high technologies (cryptography, astronomy, data security, various coding theory problems, communication networks, etc.). A labeling or a valuation of a graph is any mapping that sends a certain set of graph elements to a certain set of numbers subject to certain conditions. Graph labeling is a mapping of elements of the graph, i.e., vertex and/or edges to a set of numbers (usually positive integers), called labels. If the domain is the vertex-set or the edge-set, the labelings are called vertex labelings or edge labelings respectively. Similarly, if the domain is V (G)[E(G), then the labeling is called total labeling. A reflexive edge irregular k-labeling of graph introduced by Tanna et al.: A total labeling of graph such that for any two different edges ab and a'b' of the graph their weights has wt ab ð Þ 1⁄4 a ð Þ þ ab ð Þ þ b ð Þ a n d wt a0b0 ð Þ 1⁄4 a0 ð Þ þ a0b0 ð Þ þ b0 ð Þ a r e distinct. The smallest value of k for which such labeling exist is called the reflexive edge strength of the graph and is denoted by res(G). In this paper we have found the exact value of the reflexive edge irregularity strength of the categorical product of two paths Pa Pb ð Þ for any choice of a 3 and b 3:


Introduction
The area of graph theory has experienced fast developments during the last 60 years. Among the huge diversity of concepts that appear while studying this subject one that has gained a lot of popularity is the concept of labeling of graphs with more than 1700 papers in the literature and a very complete dynamic survey by Gallian [1]. This new branch of mathematics has caught the attention of many authors and many new labeling results appear every year. This popularity is not only due to the mathematical challenges of graph labeling, but also for the wide range of its application, for instance X-ray crystallography, coding theory, radar, astronomy, circuit design, network design and communication design. In fact, Bloom et al. studied applications of graph labeling to other branches of science and it is possible to find part of this work in Bloom et al. [2] and Bloom et al. [3].
All charts discussed in this paper are simple, finite and not directed. In Chartrand et al. [4] suggest a very nice problem. Set positive integer tags from the set 1; 2; …; k f gto the edges of a linked graph directly with at least three in this path, so that the graph becomes sporadic. Any weight (sum of the label) on each special edge. The question is what is the base estimate for the largest k on all this unexpected task? This parameter is for the graph G is known as the irregularity strength of the G and is denoted by s G ð Þ. A very nice comprehensive overview on the irregularity strength is given by Lahel [5]. For more further recent results, see the papers by Amar et al. [6], Dimitz et al. [7], Gyarfas [8], and Nierhoff [9].
There is an attraction arise from these papers as, an edge irregular k-labeling defined by v : V G ð Þ ! 1; 2; …; k f g such that for every two different edges ab and a 0 b 0 there weights If there exist such labeling for smallest value of k then it is known as the edge irregularity strength of the graph G; denoted by es G ð Þ. The parameter and lower bound of edge irregularity strength was introduced by Ahmad et al. [10] and found the exact value of the edge irregularity strength for several families of graphs.
The total labeling of graph introduced by Bača et al. [11] by taking the domain of mapping as the union of node and links of chart to positive integers up to k: This labeling of graph is called the total k labeling of the chart G if for every two different links ab and a 0 b 0 of G one has The total edge irregularity strength denoted by tes G ð Þ; is defined as the minimum k for which G has an edge irregular total k-labeling.
Keeping in view the problem imposed in Chartrand et al. [4] is there possible to find such labeling of the graph for a distinct degree. It seems to be impossible to construct a chart in which every node has a unique degree for a simple chart; however, it is possible for multigraphs (graphs in which we allow loops or multiple edges between the adjacent vertices). The question then became: What is the smallest number of parallel edges between two vertices required to ensure that the graph display vertex irregularity? This problem is equivalent to the labeling problem as described at the beginning of this section.
Using both Chartrand et al. [4] and Ahmad et al. [10] as motivation, in Ryan et al. [12], the authors decreed that the vertex labels should represent loops at the vertex. The consequence was two-fold; first, each vertex label was required to be an even integer, since each loop added two to the vertex degree; and second, unlike in total irregular labeling, the label 0 was permitted as representing a loopless vertex. Edges continued to be labelled by integers from one to k.
Thus, for a graph G, in Ryan et al. [12,13] The total k-labeling v is called an edge irregular reflexive k-labeling of the graph G if for every two different edges ab and a 0 b 0 of G, one has wt ab The smallest value of k for which such labeling exists is called the reflexive edge irregularity strength of the graph G and is denoted by res G ð Þ: In Ivanco et al. [14] purposed the following. Any graph G p; q ð Þ with maximum degree D G ð Þ other than K 5 satisfies In term of res, Ryan et al. [12] purpose the following: Any graph G p; q ð Þ with maximum degree D G ð Þ satisfies where r ¼ 1 for q j j 2; 3 mod 6 ð Þ; and zero otherwise.
2 Constructing an Edge Irregular Reflexive Labeling Let us recall the following lemma proven in Ryan et al. [12]. For every graph G p; q ð Þ, From the above lemma it is noted that the minimum weight under res of a link is one and the minimum of the maximal weight of a link is equal to the number of edges/links of the graph. Further the labeling of a link can be obtained as the sum of three numbers in which at least two must be even.
In this paper, we investigate the res for the categorical product of two paths P a and P b for a; b ! 3.

Categorical Products of Two Paths
As far as the category of graphs and full graph homomorphisms is concern, the categorical product was introduced by Culik et al. [15] and called it as the cardinal product. After then it was defined by Weichsel [16] and name it as the Kronecker product and studies the connectedness of products of finitely many factors.
Stephen et al. [17] were the first to who called the cardinal product as a categorical product. Moreover, the categorical product was extensively studied many researchers in the history of graph labeling. Ahmad et al. [18] found the total edge irregularity strength for a categorical product of two paths. Ahmad et al. [19] find the edge irregular total labeling for categorical product of two cycles. Victor et al. [20] studied the categorical product of two s-valued graphs. For the definition of categorical product of two graphs we refer [18]. Theorem 1: Let a ¼ 3 and b ! 3 be positive integers and P 3 Â P b be the categorical product of two paths then Proof. Since P 3 Â P b has 4 b À 1 ð Þ edges. Therefore, from Lemma 2 we get Next, we will show that For this we define a '-labeling on P 3 Â P b ð Þas follows: 'ððr iþ1 ;s j Þðr i ;s jþ1 ÞÞ ¼ 2j; The weights of the edges are given as under: Observe that the weights of all the links receive distinct values. So, ' is an edge irregular reflexive labeling of P 3 Â P b ð Þfor b ! 3. As required: Theorem 2: Let a ¼ 5 and b ! 5 be positive integers and P 5 Â P b be the categorical product of two paths P 5 and P b then ≢ 488 CSSE, 2021, vol.36, no.3 Proof. Since P 5 Â P b has 8 b À 1 ð Þ edges. Therefore, from Lemma 2 we get Next, we will show that For this we define a '-labeling on P 5 Â P b ð Þas follows: 'ððr i ; s j Þðr iþ1 ; s jþ1 ÞÞ ¼