Edge Irregular Reﬂexive Labeling for the Disjoint Union of Gear Graphs and Prism Graphs

: In graph theory, a graph is given names—generally a whole number—to edges, vertices, or both in a chart. Formally, given a graph G = ( V , E ) , a vertex naming is a capacity from V to an arrangement of marks. A diagram with such a capacity characterized deﬁned is known as a vertex-marked graph. Similarly, an edge naming is a mapping of an element of E to an arrangement of marks. In this case, the diagram is called an edge-marked graph. We consider an edge irregular reﬂexive k -labeling for the disjoint association of wheel-related diagrams and deduce the correct estimation of the reﬂexive edge strength for the disjoint association of m copies of some wheel-related graphs, speciﬁcally gear graphs and prism graphs.

which G has an edge irregular, total k-labeling. Evaluation of these parameters can be obtained, giving exact estimations of the aggregate edge abnormality quality for ways, cycles, stars, and haggle charts. Further details about the aggregate abnormality quality can be found in [9][10][11][12][13][14].
Issue related to unpredictable marking emerge from thinking of graphs with particular degree. In a straightforward graph, it is not possible to develop a diagram in which each vertex has a one-of-a-kind degree; be that as it may, it is possible in multigraphs (graphs in which we permit various edges between the neighboring vertices). The inquiry at this point moves toward: what is the smallest number of parallel edges between two vertices required to guarantee that the diagram shows vertex abnormality? This issue is equivalent to the marking issue as portrayed toward the start of this section. Ryan et al. [15] asserted that the vertex marks ought to represent circles at the vertex. The outcome was two-fold: first, every vertex mark was required to be a whole number, since each circle added two to the vertex degree; and second, dissimilar to absolute unpredictable marking, the mark 0 was allowed to represent a loopless vertex. Edges were then named by whole numbers from 1 to k. In this manner, they defined the marking χ e : E(G) → {1, 2, ..., k e } and χ v : V(G) → {0, 2, ..., 2k v }, and termed χ as an aggregate k-labeling of G, with The total k-labeling χ is called an edge irregular reflexive k-labeling of the diagram G if for each two unique edges rs and r s of G, wt(rs) = χ v (r) + χ e (rs) + χ v (s) = wt(r s ) = χ v (r ) + χ e (r s ) + χ v (s ). The smallest estimation of k for which such a marking exists is known as the reflexive edge strength of the diagram G and is termed res(G). For ongoing outcomes see [16,17].
The effect of this variety is not generally visible in the marking quality, but rather produced some imperative outcomes: The impact of this change leads to the following conjecture which can be used to evaluate some problematic special cases (see [18]).

Conjecture 1.
Any graph G with the most extreme degree ∆(G) other than K 5 fulfills: Baca et al. [19] proposed the following conjecture and proved Theorem 1.

Constructing an Edge Irregular Reflexive Labeling
Let us recall the following lemma: The lower bound for res(G) follows from the insignificant edge weight under an edge irregular reflexive labeling in one. The basis of the maximal edge weight is that |E(G)| can be accomplished as the total of only three numbers, no less than two of which are indeed.
In this paper, we explore the reflexive edge irregularity strength for disjoint association of m duplicates of gear and prism graphs.

The Gear Graph
The Jahangir graph is denoted J n,m , n ≥ 3, m ≥ 1, and can be obtained from a wheel graph by adding vertices in between the vertices that lie on the rim. I. It was introduced by Tomescu in [20]. For m = 2 it is known as the gear graph (see [21]). In the next theorem, we determined the edge irregular reflexive strength of disjoint union of consecutive, non-isomorphic m copies of a gear graph J j n j ,2 , n j ≥ 3.
The vertex set and the edge set of m j=1 J j n j ,2 are defined as follows: Also it is easy to see that: n j Theorem 2. Let ( m j=1 J j n j ,2 ) be the disjoint union of m consecutive, non-isomorphic copies of gear graphs with n j ≥ 3, 1 ≤ j ≤ m and n j+1 = n j + 1, with n 1 = 3, and i is to be taken modulo n j . Then Next, we will show that: For this we define an f -labeling on ( m j=1 J j n j ,2 ) as follow: For j = 1 and n 1 = 3, Figure 1 shows labelings of vertices and edges along with their weights.
For j ≥ 2, we have the following labelings and their weights as follows: if 4 ≤ i ≤ n j , (i is even) and j ≡ 0(mod 4) It is easy to check that no two edges have the same weight. Therefore, f is an edge irregular reflexive labeling of ( m j=1 J j n j ,2 ) for n j ≥ 3, which completes the proof.

The Prism Graph
Let D n be a prism graph with V(D n ) = {x i , y i : i = 1, 2, ..., n}, In the next theorem, we determine the edge irregular reflexive k-labeling for a disjoint union of consecutive, non-isomorphic m copies of prism graphs D j n j for n j ≥ 3. The vertex set and the edge set of m j=1 D j n j is given as follows: It is easy to see that Next, we will show that For this we define a f -labeling on ( m j=1 D j n ) as follow: For j = 1, Figure 2 shows the labeling of vertices and edges along with their weights. For j ≥ 2, we have the following labeling and their weights as follows: It is easy to check that no two edges have the same weight. Therefore, f is an edge irregular reflexive labeling of m j=1 D j n j for n j ≥ 3, which completes the proof.

Conclusions
In this paper we discuss the union of m consecutive copies of gear graphs and prism graphs.
We also determined the exact value of the reflexive edge strength of We conclude this paper with two open problems for future work.