On Edge Irregular Reflexive Labellings for the Generalized Friendship Graphs

We study an edge irregular reflexive k-labelling for the generalized friendship graphs, also known as flowers (a symmetric collection of cycles meeting at a common vertex), and determine the exact value of the reflexive edge strength for several subfamilies of the generalized friendship graphs.


Introduction
All graphs considered in this paper are simple, finite and undirected. Chartrand et al. in [1] proposed the following problem. Assign positive integer labels from the set {1, 2, . . . , k} to the edges of a simple connected graph of order at least three in such a way that the graph becomes irregular, i.e., the weights (label sums) at each vertex are distinct. What is the minimum value of the largest label k over all such irregular assignments? This parameter of a graph G is well known as the irregularity strength of the graph G. An excellent survey on the irregularity strength is given by Lehel in [2]. For recent results, see the papers by Amar and Togni [3], Dimitz et al. [4], Gyárfás [5] and Nierhoff [6].
Motivated by these papers in [7], an edge irregular k-labelling as a vertex labelling ρ : V(G) → {1, 2, . . . , k} was defined, such that for every two different edges xy and x y , there is w ρ (xy) = w ρ (x y ), where the weight of an edge xy ∈ E(G) is w ρ (xy) = ρ(x) + ρ(y). The minimum k for which the graph G has an edge irregular k-labelling is called the edge irregularity strength of the graph G, denoted by es(G). In [7] are estimated the bounds of the parameter es(G), and the exact values of the edge irregularity strength for several families of graphs are determined, namely paths, stars, double stars and the Cartesian product of two paths.
In [8], the authors defined the total labelling ϕ : V(G) ∪ E(G) → {1, 2, . . . , k} to be an edge irregular total k-labelling of the graph G if for every two different edges xy and x y of G one has wt ϕ (xy) = ϕ(x) + ϕ(xy) + ϕ(y) = wt ϕ (x y ) = ϕ(x ) + ϕ(x y ) + ϕ(y ). The total edge irregularity strength, tes(G), is defined as the minimum k for which G has an edge irregular total k-labelling. Estimations of this parameter are obtained in [8], which provides the precise values of the total edge The effect of this change was immediate in the following conjecture where we were able to remove the pesky exception. Conjecture 1. From [12]. Any graph G with maximum degree ∆(G) other than K 5 satisfies: +2 3 In terms of reflexive edge irregularity strength, we now propose: Conjecture 2. Any graph G with maximum degree ∆(G) satisfies: , and zero otherwise.
In this paper, we investigate the reflexive edge strength for generalized friendship graphs. The friendship graph f m is a collection of m triangles with a common vertex. It may be also pictured as a wheel with every alternate rim edge removed. Let us mention that the reflexive edge strength for wheels can be found in [17]. The generalized friendship graph f n,m is a collection of m cycles (all of order n), meeting at a common vertex. We will refer to the friendship graph f m as an instance of the generalized friendship graph and write it as f 3,m . The generalized friendship graph may also be referred to as a flower; see [18]. In this nomenclature, the cycles are referred to as petals. For our purposes, we refer to vertices in the following way: the central vertex is named x, and all other vertices are addressed in the form x j i , where j, 1 ≤ j ≤ m indicates which cycle contains the vertex and i, 1 ≤ i ≤ n points to the position of the vertex within the cycle. Therefore, x = x j n for all j. Then, we denote the edge set of the generalized friendship graph such that

Constructing an Edge Irregular
Reflexive Labelling for f n,m , n = 3, 4, 5 Let us recall the following lemma proven in [16] and the theorem proven in [19]. Lemma 1. From [16]. For every graph G, The lower bound for res(G) follows from the fact that the minimal edge weight under an edge irregular reflexive labelling is one, and the minimum of the maximal edge weights, that is |E(G)|, can be achieved only as the sum of three numbers, at least two of which are even. Theorem 1. From [19]. For every positive integer n ≥ 3: In this section, we determine the exact value of the reflexive edge strength for the generalized friendship graphs f n,m , n = 3, 4, 5, m ≥ 1.

Theorem 2.
For every positive integer m ≥ 1: Proof. The graph f 3,m has 3m edges; thus by Lemma 1, we have: As f 3,1 is isomorphic to C 3 , thus according to Theorem 1, we get res(C 3 ) = 2.
It is easy to see that res( f 3,2 ) ≥ 3. Two non-isomorphic edge irregular reflexive three-labellings for f 3,2 are illustrated in Figure 1.  For m ≥ 3, we distinguish two cases. Case 1. When m is even, we define an m-labelling f of f 3,m such that: Then, we get: It is not difficult to see that the edge weights are from the set {1, 2, . . . , 3m}. This shows that f is an edge irregular reflexive labelling of f 3,m for m ≥ 4 even.
Case 2. When m is odd, we define an (m + 1)-labelling f of f 3,m such that: Thus, the vertices are labelled with even numbers, and the edge weights are: Thus also for n odd, m ≥ 3, the edge weights are distinct numbers from the set {1, 2, . . . , 3m}. This concludes the proof.
As |E( f 4,3r+t )| = 4(3r + t) = 12r + 4t, then according to Lemma 1, we get: that is: res( f 4,3r+t ) ≥ 4r + 2t for every r ≥ 0 and t ∈ {0, 1, 2}. We define a (4r + 2t)-labelling f of f 4,3r+t such that: Evidently, the vertices are labelled by even numbers, and none of the labels are greater than 4r + 2t. Moreover, for the edge weights, we get the following: 2 ) = (2j − 2) + (2r + 1) + (4r + 2t) = 6r + 2t − 1 + 2j for j = r + t + 1, r + t + 2, . . . , 2r + t, for j = 2r + t + 1, 2r + t + 2, . . . , 3r + t, It is not difficult to see that the edge weights are from the set {1, 2, . . . , 12r + 4t}. This shows that f is an edge irregular reflexive labelling of f 4,m for m ≥ 1. Proof. As the number of edges of f 5,m is 5m, then using Lemma 1, we obtain: It is easy to see that for m ≡ 5 (mod 6), the number k is odd, and otherwise, k is even. As f 5,1 is isomorphic to C 5 , thus according to Theorem 1, we get res(C 5 ) = 2. From the lower bound for res( f 5,m ), we get that res( f 5,2 ) ≥ 4 and res( f 5,3 ) ≥ 6. A corresponding edge irregular reflexive four-labelling for f 5,2 and an edge irregular reflexive six-labelling for f 5,3 are illustrated in Figure 2. Let m ≥ 4. We distinguish two cases according to the parity of k. Case 1. When m ≡ 5 (mod 6), that is when k is an even number, we define a k-labelling f of f 5,m in the following way: For the edge weights, we get: . . , m, we have: Furthermore, the weights of edges x are: . . , m, the weights are: Additionally, for j = 1, 2, . . . , m, we get: Its is not difficult to see that the edge weights are distinct numbers from the set {1, 2, . . . , 5m}. Case 2. When m ≡ 5 (mod 6), that is when k = 5m 3 is odd, then we define a k-labelling f of f 5,m such that: The edge weights are: Also in this case, the edge weights are from the set {1, 2, . . . , 5m}. Thus, we constructed an edge irregular reflexive labelling of f 5,m for m ≥ 1.

Conclusions
In this paper, we proved the precise values of the reflexive edge strength for the generalized friendship graphs f n,m for n = 3, 4, 5, m ≥ 1. According to Theorems 2-4, we conclude the paper with the following conjecture: