Local Inclusive Distance Vertex Irregular Graphs

: Let G = ( V , E ) be a simple graph. A vertex labeling f : V ( G ) → { 1,2, . . . , k } is deﬁned to be a local inclusive (respectively, non-inclusive) d -distance vertex irregular labeling of a graph G if for any two adjacent vertices x , y ∈ V ( G ) their weights are distinct, where the weight of a vertex x ∈ V ( G ) is the sum of all labels of vertices whose distance from x is at most d (respectively, at most d but at least 1). The minimum k for which there exists a local inclusive (respectively, non-inclusive) d -distance vertex irregular labeling of G is called the local inclusive (respectively, non-inclusive) d -distance vertex irregularity strength of G . In this paper, we present several basic results on the local inclusive d -distance vertex irregularity strength for d = 1 and determine the precise values of the corresponding graph invariant for certain families of graphs.


Introduction
All graphs considered in this paper are simple finite. We use V(G) for the vertex set and E(G) for the edge set of a graph G. The neighborhood N G (x) of a vertex x ∈ V(G) is the set of all vertices adjacent to x, which is a set of vertices whose distance from x is 1. Otherwise, N G [x] denotes the set of all neighbors of a vertex x ∈ V(G) including x, which is the set of vertices whose distance from x is at most 1. We are following the standard notation and the terminology presented in [1].
The notion of the irregularity strength was introduced by Chartrand et al. in [2]. For a given edge k-labeling α : E(G) → {1, 2, . . . , k}, where k is a positive integer, the associated weight of a vertex x ∈ V(G) is w α (x) = ∑ y∈N G (x) α(xy). Such a labeling α is called irregular if w α (x) = w α (y) for every pair x, y of vertices of G. The smallest integer k for which an irregular labeling of G exists is known as the irregularity strength of G. This parameter has attracted much attention, see [3][4][5].
Inspired by irregularity strength and distance magic labeling defined in [6] and investigated in [7], Slamin [8] introduced the concept of a distance vertex irregular labeling of graphs. A distance vertex irregular labeling of a graph is a mapping β : V(G) → {1, 2, . . . , k} such that the set of vertex weights consists of distinct numbers, where the weight of a vertex x ∈ V(G) under the labeling β is defined as wt β (x) = ∑ y∈N G (x) β(y). The minimum k for which a graph G has a distance vertex irregular labeling is called the distance vertex irregularity strength of G and is denoted by dis(G).
Bong et al. [10] generalized the concept of a distance vertex irregular labeling to inclusive and non-inclusive d-distance vertex irregular labelings. The difference between inclusive and non-inclusive labeling depends on the way whether the vertex label is included in the vertex weight or not. The symbol d represents how far the neighborhood is considered. Thus, an inclusive (respectively, non-inclusive) d-distance vertex irregular labeling of a graph G is a mapping β such that the set of vertex weights consists of distinct numbers, where the weight of a vertex x ∈ V(G) is the sum of all labels of vertices whose distance from x is at most d (respectively, at most d but at least 1). The minimum k for which there exists an inclusive (respectively, non-inclusive) d-distance vertex irregular labeling of a graph G is called the inclusive (respectively, non-inclusive) d-distance vertex irregularity strength of G. The non-inclusive 1-distance vertex irregularity strength of a graph G is using Slamin's [8] terminology known as the distance vertex irregularity strength of G, denoted by dis(G). For the inclusive 1-distance vertex irregularity strength, we will use notation idis(G).
In [10] is determined the inclusive 1-distance vertex irregularity strength for paths P n , n ≡ 0 (mod 3), stars, double stars S(m, n) with m ≤ n, a lower bound for caterpillars, cycles, and wheels. In [11] is established a lower bound of the inclusive 1-distance vertex irregularity strength for any graph and determined the exact value of this parameter for several families of graphs, namely for complete and complete bipartite graphs, paths, cycles, fans, and wheels. More results on triangular ladder and path for d ≥ 1 has been proved in [12,13].
Motivated by a distance vertex labeling [8], an irregular labeling [2] and a recent paper on a local antimagic labeling [14], we introduce in this paper the concept of local inclusive and local non-inclusive d-distance vertex irregular labelings.
A vertex labeling f : V(G) → {1, 2, . . . , k} is defined to be a local inclusive (respectively, non-inclusive) d-distance vertex irregular labeling of a graph G if for any two adjacent vertices x, y ∈ V(G) their weights are distinct, where the weight of a vertex x ∈ V(G) is the sum of all labels of vertices whose distance from x is at most d (respectively, at most d but at least 1). The minimum k for which there exists a local inclusive (respectively, non-inclusive) ddistance vertex irregular labeling of G is called the local inclusive (respectively, non-inclusive) d-distance vertex irregularity strength of G and denoted by lidis d (G) (respectively, ldis d (G)). If there is no such labeling for the graph G then the value of lidis d (G) is defined as ∞. In the case when d = 1 the index d can be omitted, thus lidis 1 (G) = lidis(G) (respectively, ldis 1 (G) = ldis(G)). In this paper, we only discuss the case for inclusive labeling with d = 1. Note that the concept of a local non-inclusive distance vertex irregular labeling has been introduced earlier in [15] with a different name. For more information about labeled graphs see [16].
In this paper, we present several basic results and some estimations on the local inclusive 1-distance vertex irregularity strength and determine the precise values of the corresponding graph invariant for several families of graphs.

Basic Properties
In the following observations, we give several basic properties of lidis(G). The first observation gives a relation between the local inclusive distance vertex irregularity strength, lidis(G), and the inclusive distance vertex irregularity strength, idis(G). The second and third observations give the requirement for giving the label of two vertices which have a common neighbor.   The next theorem gives a sufficient and necessary condition for lidis(G) < ∞. Note that the graph G is not necessarily connected.
Immediately from the previous theorem we obtain the following result.
Thus, for complete graphs we obtain Corollary 2. Let n be a positive integer. Then Now, we present a sufficient and necessary condition for lidis(G) = 1. The chromatic number of a graph G, denoted by χ(G), is the smallest number of colors needed to color the vertices of G so that no two adjacent vertices share the same color, see [1]. The following result gives a trivial lower bound for the number of distinct induced vertex weights under any local inclusive distance vertex irregular labeling of a graph G.
Theorem 3. For a graph G, the number of distinct induced vertex weights under any local inclusive distance vertex irregular labeling is at least χ(G).

Local Inclusive Distance Vertex Irregularity Strength for Several Families of Graphs
In this section, we provide the exact values of local inclusive distance vertex irregularity strengths of some standard graphs such as paths, cycles, complete bipartite graphs, complete multipartite graphs, and caterpillars. We also give results on several products of graphs, such as corona graphs, union graphs, and join product graphs.
Theorem 4. Let C n be a cycle on n vertices n ≥ 3. Then Proof. Let V(C n ) = {v i : i = 1, 2, . . . , n} be the vertex set and let E(C n ) = {v i v i+1 : i = 1, 2, . . . , n − 1} ∪ {v 1 v n } be the edge set of a cycle C n . The lower bound for the local inclusive distance vertex irregularity strength of C n follows from Theorem 3 as if n is even.
As C 3 is isomorphic to K 3 we use Corollary 2 in this case. For n even, we label the vertices of C n as follows Then, for the vertex weights we obtain Thus, for n even we obtain lidis(C n ) = 2.
For n = 5, we label the vertices such that For n odd, n ≥ 7, the vertices are labeled in the following way The weights of vertices are As adjacent vertices have distinct weights we obtain lidis(C n ) = 3 for n odd. The above explanation concludes the proof. Corollary 3. Let P n be a path on n vertices n ≥ 2. Then Proof. Let V(P n ) = {v i : i = 1, 2, . . . , n} be the vertex set and let E(P n ) = {v i v i+1 : i = 1, 2, . . . , n − 1} be the edge set of a path P n . The result for n = 2 follows from Corollary 2. For n ≥ 3, according to Theorem 3, the lidis(P n ) should be more than one. Using the vertex labels for n even as in Theorem 4 and the corresponding vertex weights are Thus, lidis(P n ) = 2.
The following corollary gives the exact value of the studied parameter for complete bipartite graphs. Corollary 4. Let K m,n , 1 ≤ m ≤ n, be a complete bipartite graph. Then The corona product of G and H is the graph G H obtained by taking one copy of G, called the center graph along with |V(G)| copies of H, called the outer graph, and making the ith vertex of G adjacent to every vertex of the ith copy of H, where 1 ≤ i ≤ |V(G)|. For arbitrary graphs G, we can prove the following result. Moreover, if G is a graph with no component of order 1 then also lidis(G K 1 ) ≤ lidis(G).
Proof. If lidis(G) = ∞ then by Theorem 1 there exists at least one edge uv ∈ E(G) such that N G [u] = N G [v]. However, as for r ≥ 2 or for r = 1 if G has no component of order 1, in G K r all vertices have distinct closed neighborhood and thus lidis(G K r ) < ∞. Now, consider that lidis(G) < ∞ and let f be a local inclusive distance vertex irregular labeling of G. We define a labeling g of G K r such that For the vertex weights, we obtain Evidently, for r ≥ 2 or for r = 1 if G has no component of order 1, i.e., deg G (v) ≥ 1 for every v ∈ V(G), we obtain that under the labeling g the vertex weights of adjacent vertices are different.
Moreover, we can prove that the parameter lidis(G K r ) is finite except the case when G K r contains a component isomorphic to K 2 .
and let v j i , j = 1, 2, . . . , r be the vertices of degree 1 adjacent to v i , i = 1, 2, . . . , |V(G)|, in G K r . Now, we define a labeling f that assigns 1 to every vertex of G. Thus, for every We extend the labeling f of the graph G to the labeling g of the graph G K r in the following way The induced vertex weights are . . , |V(G)|, j = 1, 2, . . . , r.
For r ≥ 2 and for r = 1 if the graph G has no component of order 1, i.e., deg(v i ) ≥ 1 for every i = 1, 2, . . . , |V(G)|, we obtain that all adjacent vertices have distinct weights.
Note that the upper bound in the previous theorem is tight, since lidis(K n K 1 ) = n. Immediately, from Theorem 2, we have the following result Now, we present results for corona product of paths, cycles, and complete graphs with totally disconnected graph K r , r ≥ 1. Combining Theorems 3 and 6, we obtain Theorem 9. Let P n be a path on n vertices n ≥ 2 and let r be a positive integer. Then lidis(P n K r ) = 2.  For odd n and (n, r) = (3, 1), we define a vertex labeling f of C n K r such that 2, for i = 2, 4, . . . , n − 1, n and j = 1, 1, otherwise.
We define a vertex labeling f of K n K r such that where for every i = 1, 2, . . . , n the parameter Evidently adjacent vertices have distinct weights. Thus, as the maximal vertex label is 1 + (n − 1)/r , the proof is completed.
A caterpillar is a graph derived from a path by hanging any number of leaves from the vertices of the path. We denote the caterpillar as S n 1 ,n 2 ,...,n r , where the vertex set is V(S n 1 ,n 2 ,...,n r ) = {c i : Theorem 12. For every caterpillar S n 1 ,n 2 ,...,n r with at least 3 vertices holds lidis(S n 1 ,n 2 ,...,n r ) ≤ 2.
For the other cases, label the vertices of a caterpillar S n 1 ,n 2 ,...,n r using the following algorithm.
Then the weights of vertices c i , i = 1, 2, . . . , r are deg(c i ) and all vertices of degree 1 have weight 2.
Step 3: If such number does not exist, it means that adjacent vertices have distinct degrees and thus lidis(S n 1 ,n 2 ,...,n r ) = 1. We are done.
Step 4: If such number exists either relabel a leaf of adjacent to c s+1 (if a leaf exists) from 1 to 2 or relabel the vertex c s+2 from 1 to 2. Then wt(c s+1 ) = wt(c s ) + 1. Note that this relabeling will not have an effect on weights of vertices c i for every i ≤ s.
Step 6: If such number does not exist, it means that adjacent vertices have distinct degrees and thus lidis(S n 1 ,n 2 ,...,n r ) = 2. We are finished.
Step 7: If such number exists either relabel a leaf of adjacent to c t+1 (if a leaf exists) from 1 to 2 or relabel the vertex c t+2 from 1 to 2. Then wt(c s+1 ) = wt(c t ) + 1.
After a finite number of steps, the algorithm stops and the weights of the vertices are always different from the weights of their neighbors.
A similar algorithm can be used to obtain a result for closed caterpillars, which are graphs where the removal of all pendant vertices gives a cycle. We denote the closed caterpillar as CS n 1 ,n 2 ,...,n r , where the vertex set is V(CS n 1 ,n 2 ,...,n r ) = {c i : Immediately from the previous theorem, we obtain the following result.
Corollary 5. Let n be a non-negative integer and let G be a graph. Then, lidis(G ∪ nK 1 ) = lidis(G).
The join G ⊕ H of the disjoint graphs G and H is the graph G ∪ H together with all the edges joining vertices of V(G) and vertices of V(H). Let ∆(G) denote the maximal degree of the graph G.

Theorem 15. For any graph G holds
Proof. Let w be the vertex of K 1 . In a graph G ⊕ K 1 the vertex w is adjacent to all vertices in G we immediately get that lidis(G ⊕ K 1 ) ≥ lidis(G).
Let ∆(G) < |V(G)| − 1. If lidis(G) = ∞ then by Theorem 1 there exists at least two vertices, say u and v in G such that N G [u] = N G [v]. However, these vertices have the same closed neighborhood also in the graph G ⊕ K 1 as However, this implies that lidis(G ⊕ K 1 ) = ∞ = lidis(G). Now, consider that lidis(G) < ∞ and let f be a corresponding local inclusive distance vertex irregular graph of G. We define a labeling g of G ⊕ K 1 in the following way The induced vertex weights are Thus, all adjacent vertices have distinct weights. This means that g is a local inclusive distance vertex irregular labeling of G ⊕ K 1 . As vertex w is adjacent to every vertex in G we get lidis(G ⊕ K 1 ) = lidis(G) in this case. This concludes the proof.
The graph in the previous theorem is not necessarily connected. Theorem 16. Let G i , i = 1, 2, . . . , m, m ≥ 2 be arbitrary graphs. Then Proof. The proof follows from Theorems 14 and 15.
A wheel W n with n spokes is isomorphic to the graph C n ⊕ K 1 . A fan graph F n is isomorphic to the graph P n ⊕ K 1 , while a generalized fan graph is isomorphic to the graph kP n ⊕ K 1 . The following results are immediate corollaries of the previous theorems. Corollary 8. Let kP n ⊕ K 1 be a generalized fan graph, k, n ≥ 2. Then lidis(kP n ⊕ K 1 ) = 2.
If lidis(G) = ∞ then by Theorem 1 there exist at least two vertices, say u and v in G such that they have the same closed neighborhood N G [u] = N G [v]. Thus, we immediately get where w i , i = 1, 2, . . . , r, are the vertices of K r . Thus, lidis(G ⊕ K r ) = ∞ for every positive integer r. Now we will deal with the case when lidis(G) < ∞ and r ≥ 2.
Proof. Let us denote the vertices K r by the symbols w i , i = 1, 2, . . . , r and let r ≥ 2. Thus, V(G ⊕ K r ) = V(G) ∪ {w i : i = 1, 2, . . . , r}. In a graph G ⊕ K r all the vertices w i , i = 1, 2, . . . , r are adjacent to all vertices in G thus we immediately get that lidis(G ⊕ K r ) ≥ lidis(G).
Let lidis(G) < ∞ and let f be a corresponding local inclusive distance vertex irregular labeling of G. We define a labeling g of G ⊕ K r in the following way Then, the vertex weights are if v ∈ V(G).
Evidently, under the labeling g, all adjacent vertices in V(G) have distinct weights. We need also to prove that no vertex in V(G) has the same weight as in V(K r ). Consider that r ≥ |V(G)| · lidis(G).
As G is not isomorphic to a totally disconnected graph then for the weight of any vertex v in V(G) we have wt g (v) =wt f (v) + r ≥ 1 + |V(G)| · lidis(G) > 1 + ∑ u∈V(G) f (u) = wt g (w i ) for every i = 1, 2, . . . , r. Thus, g is a local inclusive distance vertex irregular graph of G ⊕ K r and hence lidis(G ⊕ K r ) ≤ lidis(G).
Note that for small r the previous theorem is not necessarily true. Consider the graph G illustrated on Figure 2, evidently lidis(G) = 1. However, lidis(G ⊕ K 3 ) = 2.

Conclusions
In this paper, we introduced the local inclusive distance vertex irregularity strength of graphs and gave some basic results and also some constructions of the feasible labelings for several families of graphs. We still have some open problems and conjecture as follows: Problem 1. Find lidis(K n 1 ,n 2 ,...,n m ) for general case, which is for the case n 1 ≤ n 2 ≤ · · · ≤ n m , where m > 2.