$D$-irregularity strength of a graph

Susanto, Faisal; Simanjuntak, Rinovia; Baskoro, Edy Tri

doi:10.61091/um121-06

Abstract

1. Introduction
2. Basic properties
3. Graphs with small diameter
4. Graphs with small maximum degree
5. Final remarks
Acknowledgements

References

Utilitas Mathematica

Volume 121
Pages: 69-90

Research article

$D$ -irregularity strength of a graph

^¹, ^², ^²

¹Doctoral Program of Mathematics, Faculty of Mathematics and Natural Sciences, Institut Teknologi Bandung, Indonesia

²Combinatorial Mathematics Research Group, Faculty of Mathematics and Natural Sciences, Institut Teknologi Bandung, Indonesia Center for Research Collaboration on Graph Theory and Combinatorics, Indonesia

Received: 19/10/2024
Accepted: 14/12/2024
Published: 31/12/2024

Copyright Link
License

Abstract

We initiate to study a $D$ -irregular labeling, which generalizes both non-inclusive and inclusive $d$ -distance irregular labeling of graphs. Let $G = (V (G), E (G))$ be a graph, $D$ a set of distances, and $k$ a positive integer. A mapping $φ$ from $V (G)$ to the set of positive integers ${1, 2, \dots, k}$ is called a $D$ -irregular $k$ -labeling of $G$ if every two distinct vertices have distinct weights, where the weight of a vertex $x$ is defined as the sum of labels of vertices whose distance from $x$ belongs to $D$ . The least integer $k$ for which $G$ admits a $D$ -irregular labeling is the $D$ -irregularity strength of $G$ and denoted by $s_{D} (G)$ . In this paper, we establish several fundamental properties on $D$ -irregularity strength for arbitrary graphs. We also determine this parameter exactly for families of graphs with small diameter or small maximum degree.

Keywords: Graph labeling,

D

-irregular

k

-labeling,

D

-irregularity strength, Distance

1. Introduction

Throughout the paper, only undirected simple finite graphs are considered. For undefined terminology and notation, we follow [8]. Let $G$ be a graph. We will denote by $V (G)$ and $E (G)$ the vertex and edge set of $G$ , respectively. The distance between two vertices $x, y \in V (G)$ will be denoted by $d (x, y)$ .

Graph labeling has been an intriguing topic, extensively studied over the last six decades. To date, over $350$ graph labelings techniques have been developed in over $3600$ papers [11], one of which is a distance antimagic labeling, firstly established by Kamatchi and Arumugam [14]. A bijection $φ : V (G) \to {1, 2, \dots, | V (G) |}$ is said to be a distance antimagic labeling of a graph $G$ if the vertex weights, given by $w t (x) = \sum_{z \in N (x)} φ (z),$ are all distinct, where $N (x)$ , the open neighborhood of $x$ , is the set of all vertices adjacent to $x$ . A distance antimagic graph is a graph that has a distance antimagic labeling.

Simanjuntak et al. [16] introduced a more generalized concept, called a $D$ -antimagic labeling, where $D$ is a non-empty subset of the set ${0, 1, \dots, d i a m (G)}$ . Here, the difference is that the weight of a vertex $x$ is now defined as $w t (x) = \sum_{z \in N_{D} (x)} φ (z),$ where $N_{D} (x) = {z : d (x, z) \in D}$ is the $D$ -neighborhood of $x$ . A graph that admits a $D$ -antimagic labeling is called $D$ -antimagic. Notably, a ${1}$ -antimagic graph is corresponds to a distance antimagic graph. Some graph families have been proved to be $D$ -antimagic, among others, see [9,12,13,14,16,17,24].

Instead of looking at bijection type labelings, Chartrand et al. [7] considered an edge $k$ -labeling $φ : E (G) \to {1, 2, \dots, k}$ of a graph $G$ , where distinct edges may receive an identical label, such that the vertex weights, $w t (x) = \sum_{x y \in E (G)} φ (x y),$ are all distinct. They named such labelings irregular assignments and the irregularity strength, $s (G)$ , is the minimum positive integer $k$ such that $G$ has an irregular assignment using labels not exceeding $k$ . This topic has gained significant interest, with numerous papers published; see [2,3,15] for some recent results.

Combining distance-based labelings and irregular assignments, Slamin [18] introduced a non-inclusive distance irregular $k$ -labeling of a graph $G$ as a mapping $φ : V (G) \to {1, 2, \dots, k}$ such that for every two distinct vertices $x, y \in V (G)$ there is $w t (x) \neq w t (y)$ , where $w t (x) = \sum_{z \in N (x)} φ (z),$ is the weight of a vertex $x$ . The non-inclusive distance irregularity strength, $d i s (G)$ , of $G$ is the smallest integer $k$ such that $G$ has a non-inclusive distance irregular labeling. There are not many graphs whose non-inclusive distance irregularity strengths are known. Among those that are known include paths, complete graphs, cycles, wheels, fan and book graphs [5,18], disjoint union of paths, suns, helms and friendships [20].

Later on, Bača et al. [4] modified such a labeling and introduced an inclusive distance irregular labeling of graphs. In this case, the label of the vertex is also included in the computation of its vertex weight, while the non-inclusive is not. Furthermore, the two labelings were generalized by Bong et al. [6] to non-inclusive and inclusive $d$ -distance irregular labelings, where $d$ is an integer arbitrarily taken from $1$ up to the diameter of the graph. A (non-)inclusive $1$ -distance irregular labeling is also called a (non-)inclusive distance irregular labeling. For more information on these subjects one can see [19,21,22,23].

In this paper, we propose a new invariant, called a $D$ -irregular labeling, which generalizes the previous labelings mentioned in [4,16,18]. This generalization is analogous to $D$ -antimagic labelings by Simanjuntak et al. [16]. The formal definition is provided below.

Definition 1.1. Let $G = (V (G), E (G))$ be a graph with diameter $d i a m (G)$ . For a non-empty set of distances $D \subseteq {0, 1, \dots, d i a m (G)}$ and a positive integer $k$ , a function $φ : V (G) \to {1, 2, \dots, k}$ is called a $D$ -irregular $k$ -labeling of $G$ if $w t (x) \neq w t (y)$ for every two distinct vertices $x, y \in V (G)$ , where the weight of a vertex $x$ is defined as $w t (x) = \sum_{z \in N_{D} (x)} φ (z) .$

We set $w t (x) = 0$ if $N_{D} (x) = \emptyset$ . The $D$ -irregularity strength of $G$ , denoted by $s_{D} (G)$ , is the minimum $k$ such that $G$ admits a $D$ -irregular labeling. If such an integer $k$ does not exist then we define $s_{D} (G) = \infty$ .

In a case when $G$ is disconnected, we have that $d i a m (G) = \infty$ , and $D \subseteq {0, 1, \dots}$ . Suppose that $G_{1}, G_{2}, \dots, G_{m}$ , $m ⩾ 2$ , be the components of $G$ , $max_{1 ⩽ i ⩽ m} d i a m (G_{i}) = \partial$ , and $D^{'} \subseteq D \cap {\partial + 1, \partial + 2, \dots}$ . Then $s_{D} (G) = s_{D - D^{'}} (G)$ . Moreover, from Definition 1.1, it follows that

A ${1}$ -irregular labeling is a non-inclusive distance irregular labeling.
A ${0, 1}$ -irregular labeling is an inclusive distance irregular labeling.
For $d \in {1, 2, \dots, d i a m (G)}$ , a ${1, 2, \dots, d}$ -irregular labeling is a non-inclusive $d$ -distance irregular labeling.
For $d \in {1, 2, \dots, d i a m (G)}$ , a ${0, 1, \dots, d}$ -irregular labeling is an inclusive $d$ -distance irregular labeling.

The rest of the paper is organized as follows. In Section 2, we present fundamental properties of $D$ -irregularity strength for arbitrary graphs. In Section 3, we compute the exact values on this parameter for certain graphs with small diameter. Section 4 addresses graphs with small maximum degree. Finally, Section 5 presents concluding remarks.

2. Basic properties

We start with the following theorem which provides the necessary and sufficient conditions for a graph to possess finite $D$ -irregularity strength.

Theorem 2.1. Let $G$ be a graph. Then $s_{D} (G) = \infty$ if and only if there exist two distinct vertices $x, y \in V (G)$ such that $N_{D} (x) = N_{D} (y)$ . Moreover, if $s_{D} (G) < \infty$ then $s_{D} (G) ⩽ 2^{| V (G) | - 1}$ .

Proof. Let $x, y$ be two vertices of $G$ with $N_{D} (x) = N_{D} (y)$ . Then, in any vertex labeling $φ$ of $G$ , $w t (x) = \sum_{z \in N_{D} (x)} φ (z) = \sum_{z \in N_{D} (y)} φ (z) = w t (y),$ meaning that $φ$ can not be $D$ -irregular.

Now suppose that $N_{D} (x) \neq N_{D} (y)$ for every two distinct vertices $x, y \in V (G)$ . Let us denote the vertices of $G$ arbitrarily by the symbols $x_{1}, x_{2}, \dots, x_{| V (G) |}$ . Define a vertex $(2^{| V (G) | - 1})$ -labeling $φ$ of $G$ as follows: $φ (x_{i}) = 2^{i - 1} for i = 1, 2, \dots, | V (G) | .$ We define a labeling $β$ such that $β_{i j} = {\begin{cases} 1 & if x_{i} \in N_{D} (x_{j}), \\ 0 & if x_{i} \notin N_{D} (x_{j}), \end{cases}$ where $i = 1, 2, \dots, | V (G) |$ and $j = 1, 2, \dots, | V (G) |$ . Then, $\begin{matrix} (1) & w t (x_{j}) = \sum_{x_{i} \in N_{D} (x_{j})} φ (x_{i}) = \sum_{i : x_{i} \in N_{D} (x_{j})} 2^{i - 1} = \sum_{i = 1}^{| V (G) |} β_{i j} 2^{i - 1} . \end{matrix}$

To prove that all the vertex weights are distinct, it suffices to show that the sums $\sum_{i = 1}^{| V (G) |} β_{i j} 2^{i - 1}$ are all distinct for $j = 1, 2, \dots, | V (G) |$ . However, this is evident if we consider that the ordered $| V (G) |$ -tuple $(β_{1 j}, β_{2 j}, \dots, β_{| V (G) | j})$ corresponds to the binary code representation of the sum (1). Because $N_{D} (x) \neq N_{D} (y)$ for every two distinct vertices $x, y \in V (G)$ we can get that the $| V (G) |$ -tuples are distinct for distinct vertices. Hence $s_{D} (G) ⩽ 2^{| V (G) | - 1}$ .

In a non-trivial graph $G$ , it is evident that if $D = {0, 1, \dots, d i a m (G)}$ then $N_{D} (x) = V (G) = N_{D} (y)$ for any two vertices $x, y \in V (G)$ , and so by Theorem 2.1 $G$ has no $D$ -irregular labeling. Hence, the next corollary holds.

Corollary 2.2. . Let $G$ be a non-trivial graph. Then $s_{{0, 1, \dots, d i a m (G)}} (G) = \infty$ .

For a graph $G$ and a set of distances $D$ , the complement of $D$ , denoted by $D^{c}$ , is a set in which $D \cup D^{c} = {0, 1, \dots, d i a m (G)}$ and $D \cap D^{c} = \emptyset$ . In the next theorem, we give a relationship between $D$ -irregularity strength and $D^{c}$ -irregularity strength of graphs.

Theorem 2.3. Let $G$ be a non-empty graph. Then

$s_{D} (G) = \infty$ if and only if $s_{D^{c}} (G) = \infty$ .
If $G$ is connected and $s_{D} (G) < \infty$ then $s_{D^{c}} (G) = s_{D} (G)$ .
Let $G$ be a disconnected graph with components $G_{1}, G_{2}, \dots, G_{m}$ for $m ⩾ 2$ , and $s_{D} (G) < \infty$ . If there exists a $D$ -irregular $s_{D} (G)$ -labeling $φ$ of $G$ with the property that $w t (x) - w t (y) \neq \sum_{z \in V (G_{i})} φ (z) - \sum_{z \in V (G_{j})} φ (z)$ for every two distinct vertices $x \in V (G_{i})$ and $y \in V (G_{j})$ , $i \neq j$ , then $s_{D^{c}} (G) ⩽ s_{D} (G)$ .

Proof. (a) If $s_{D} (G) = \infty$ then by Theorem 2.1 there exist two distinct vertices $x, y \in V (G)$ such that $N_{D} (x) = N_{D} (y)$ . If $G$ is connected then $\begin{aligned} N_{D^{c}} (x) & = N_{{0, 1, \dots, d i a m (G)} - D} (x) \\ = V (G) - N_{D} (x) = V (G) - N_{D} (y) = N_{{0, 1, \dots, d i a m (G)} - D} (y) = N_{D^{c}} (y), \end{aligned}$ and so $s_{D^{c}} (G) = \infty$ by Theorem 2.1.

Next, let $G$ be disconnected with components $G_{1}, G_{2}, \dots, G_{m}$ for some $m ⩾ 2$ . If $x, y \in V (G_{i})$ for some $i$ , then $\begin{aligned} N_{D^{c}} (x) & = N_{{0, 1, \dots} - D} (x) = N_{({0, 1, \dots, d i a m (G_{i})} - D) \cup {d i a m (G_{i}) + 1, d i a m (G_{i}) + 2, \dots}} (x) \\ = N_{{0, 1, \dots, d i a m (G_{i})} - D} (x) = V (G_{i}) - N_{D} (x) = V (G_{i}) - N_{D} (y) \\ = N_{{0, 1, \dots, d i a m (G_{i})} - D} (y) = N_{({0, 1, \dots, d i a m (G_{i})} - D) \cup {d i a m (G_{i}) + 1, d i a m (G_{i}) + 2, \dots}} (y) \\ = N_{{0, 1, \dots} - D} (y) = N_{D^{c}} (y), \end{aligned}$ thus $s_{D^{c}} (G) = \infty$ by Theorem 2.1. If $x \in V (G_{i})$ and $y \in V (G_{j})$ with $d i a m (G_{i}) ⩾ d i a m (G_{j})$ for $i \neq j$ , then $N_{D} (x) = N_{D} (y) = \emptyset$ , and so $D \subseteq {d i a m (G_{i}) + 1, d i a m (G_{i}) + 2, \dots}$ . As $G$ is a non-empty graph, we may assume that $G_{i}$ contains at least two vertices. Indeed, for every two distinct vertices $x, z \in V (G_{i})$ , $N_{D^{c}} (x) = N_{D^{c}} (z) = N_{{0, 1, \dots} - D} (z) = N_{({0, 1, \dots, d i a m (G_{i})} - D) \cup {d i a m (G_{i}) + 1, d i a m (G_{i}) + 2, \dots}} (z) = N_{{0, 1, \dots, d i a m (G_{i})}} (z) = V (G_{i})$ , hence $s_{D^{c}} (G) = \infty$ by Theorem 2.1.

Conversely, if $s_{D^{c}} (G) = \infty$ , similar reasoning shows that $s_{D} (G) = \infty$ .

(b) Let $G$ be connected and $s_{D} (G) < \infty$ . Let $φ$ be a $D$ -irregular $s_{D} (G)$ -labeling of $G$ . We define a new vertex labeling $φ^{'}$ of $G$ in such a way that $φ^{'} (x) = φ (x) for x \in V (G) .$

We show that $φ^{'}$ is a $D^{c}$ -irregular $s_{D} (G)$ -labeling of $G$ .

Evidently $φ^{'} (x) ⩽ s_{D} (G)$ for all $x \in V (G)$ . For the vertex weights under the labeling $φ^{'}$ we have $w t (x) = \sum_{z \in N_{D^{c}} (x)} φ^{'} (z) = \sum_{z \in N_{{0, 1, \dots, d i a m (G)} - D} (x)} φ^{'} (z) = \sum_{z \in V (G_{i})} φ (z) - \sum_{z \in N_{D} (x)} φ (z) .$

Note that the sums $\sum_{z \in N_{D} (x)} φ (z)$ are distinct for each $x \in V (G)$ since $φ$ is $D$ -irregular. This implies that $w t (x) \neq w t (y)$ for every two distinct vertices $x, y \in V (G)$ , and so $s_{D^{c}} (G) ⩽ s_{D} (G)$ .

Since $s_{D} (G) < \infty$ we have $s_{D^{c}} (G) < \infty$ according to (1). Then, by similar arguments, we can prove that $s_{D} (G) ⩽ s_{D^{c}} (G)$ . Therefore $s_{D^{c}} (G) = s_{D} (G)$ .

(c) Let $G$ be a disconnected graph with components $G_{1}, G_{2}, \dots, G_{m}$ for $m ⩾ 2$ , and $s_{D} (G) < \infty$ . Assume $φ$ be a $D$ -irregular $s_{D} (G)$ -labeling of $G$ satisfying the stated condition. Define a new vertex labeling $φ^{'}$ of $G$ such that $φ^{'} (x) = φ (x) for x \in V (G) .$

We shall show that $φ^{'}$ is a $D^{c}$ -irregular $s_{D} (G)$ -labeling of $G$ .

Clearly $φ^{'} (x) ⩽ s_{D} (G)$ for all $x \in V (G)$ . Let us consider the weight of any vertex $x$ in the component $G_{i}$ , $i = 1, 2, \dots, m$ , under the labeling $φ^{'}$ . We have $\begin{aligned} w t (x) & = \sum_{z \in N_{D^{c}} (x)} φ^{'} (z) = \sum_{z \in N_{{0, 1, \dots} - D} (x)} φ^{'} (z) \\ = \sum_{z \in N_{({0, 1, \dots, d i a m (G_{i})} - D) \cup {d i a m (G_{i}) + 1, d i a m (G_{i}) + 2, \dots}} (x)} φ^{'} (z) \\ = \sum_{z \in N_{{0, 1, \dots, d i a m (G_{i})} - D} (x)} φ^{'} (z) \\ = \sum_{z \in V (G_{i})} φ (z) - \sum_{z \in N_{D} (x)} φ (z) . \end{aligned}$

Consider any two distinct vertices $x, y \in V (G)$ . Evidently if $x$ and $y$ are in the same component then $w t (x) \neq w t (y)$ since $\sum_{z \in N_{D} (x)} φ (z) \neq \sum_{z \in N_{D} (y)} φ (z)$ . Now, suppose that $x$ and $y$ are in the different components, say $x \in V (G_{i})$ and $y \in V (G_{j})$ for $i \neq j$ . By the property in (3), it follows that $w t (x) \neq w t (y)$ . So all the vertex weights are distinct, and hence $s_{D^{c}} (G) ⩽ s_{D} (G)$ .

It is evident that every $D$ -antimagic labeling is also a $D$ -irregular labeling. Consequently, we derive the following property, which provides a better upper bound for $s_{D} (G)$ in a case that $G$ is $D$ -antimagic.

Proposition 2.4. Let $G$ be a $D$ -antimagic graph on $n$ vertices. Then $s_{D} (G) ⩽ n$ .

The next proposition, which is straightforward, shows that the upper bound in Proposition 2.4 is sharp.

Proposition 2.5. Let $G$ be a graph on $n$ vertices. If one of the following conditions holds:

$G$ is connected and $D \in {{0}, {1, 2, \dots, d i a m (G)}}$ ,
$G ≅ m K_{2}$ , $m ⩾ 2$ , and $D \in {{0}, {1}}$ , or
$G$ is disconnected, $G ≇ m K_{2}$ , $m ⩾ 2$ , and $D = {0}$ ,

then $G$ is $D$ -antimagic and $s_{D} (G) = n$ .

In the next theorem, we provide lower bounds for $D$ -irregularity strength of arbitrary graphs. For a vertex $x$ in a graph $G$ , the $D$ -degree, $d_{D} (x)$ of $x$ is the cardinality of the set $N_{D} (x)$ .

Theorem 2.6. Let $G$ be a graph with $s_{D} (G) < \infty$ . Let $δ_{D} (G)$ and $Δ_{D} (G)$ be the minimum and the maximum $D$ -degree of vertices of $G$ , respectively. Let $n_{D, i}$ be the number of vertices in $G$ with $D$ -degree $i$ for $i = δ_{D} (G), δ_{D} (G) + 1, \dots, Δ_{D} (G)$ . Then, $s_{D} (G) ⩾ max_{δ_{D} (G) ⩽ i ⩽ Δ_{D} (G)} {⌈ \frac{δ_{D} (G) + \sum_{j = δ_{D} (G)}^{i} n_{D, j} - 1}{i} ⌉} .$

Proof. For some $t$ , let $⌈ \frac{δ_{D} (G) + \sum_{j = δ_{D} (G)}^{t} n_{D, j} - 1}{t} ⌉ = max_{δ_{D} (G) ⩽ i ⩽ Δ_{D} (G)} {⌈ \frac{δ_{D} (G) + \sum_{j = δ_{D} (G)}^{i} n_{D, j} - 1}{i} ⌉} .$ In any $D$ -irregular labeling of a graph $G$ , the smallest weight of vertices with $D$ -degrees $δ_{D} (G), δ_{D} (G) + 1, \dots, t$ is at least $δ_{D} (G)$ , and the largest among them must be at least $δ_{D} (G) + \sum_{j = δ_{D} (G)}^{t} n_{D, j} - 1$ . Such largest weight is obtained from the sum of at most $t$ labels. Therefore $\begin{aligned} s_{D} (G) & ⩾ ⌈ \frac{δ_{D} (G) + \sum_{j = δ_{D} (G)}^{t} n_{D, j} - 1}{t} ⌉ = max_{δ_{D} (G) ⩽ i ⩽ Δ_{D} (G)} {⌈ \frac{δ_{D} (G) + \sum_{j = δ_{D} (G)}^{i} n_{D, j} - 1}{i} ⌉} . \end{aligned}$

Notice that if $D = {1}$ , $D = {0, 1}$ , and $D = {0, 1, \dots, d}$ , $1 ⩽ d ⩽ d i a m (G)$ , then we acquire the lower bounds for $s_{D} (G)$ which were proved in [21, Theorem 2.1], [19, Theorem 2], and [23, Lemma 2.1], respectively.

The next two theorems demonstrate key properties that will be instrumental in determining the $D$ -irregularity strength of a graph.

Theorem 2.7. Let $G$ be a graph with $s_{D} (G) < \infty$ . Let $x, y$ be two distinct vertices of $G$ such that $N_{D} (x) - {y} = N_{D} (y) - {x}$ . Then $x$ and $y$ must receive distinct labels in any $D$ -irregular labeling of $G$ . Furthermore, if $G$ is connected then $x$ and $y$ must receive distinct labels in any $D^{c}$ -irregular labeling of $G$ .

Proof. Let $x, y$ be two distinct vertices of $G$ with $N_{D} (x) - {y} = N_{D} (y) - {x}$ . As $s_{D} (G) < \infty$ , $x \in N_{D} (y)$ and $y \in N_{D} (x)$ . Next, in any $D$ -irregular labeling $φ$ of $G$ , $w t (x) = \sum_{z \in N_{D} (x)} φ (z) = φ (y) + \sum_{z \in N_{D} (x) - {y}} φ (z),$ and $w t (y) = \sum_{z \in N_{D} (y)} φ (z) = φ (x) + \sum_{z \in N_{D} (y) - {x}} φ (z) .$

Since $w t (x) \neq w t (y)$ and $\sum_{z \in N_{D} (x) - {y}} φ (z) = \sum_{z \in N_{D} (y) - {x}} φ (z)$ then $φ (x) \neq φ (y)$ .

Now let $G$ be connected. Then, in any $D^{c}$ -irregular labeling $φ$ of $G$ , $\begin{aligned} w t (x) & = \sum_{z \in N_{D^{c}} (x)} φ (z) = \sum_{z \in N_{{0, 1, \dots, d i a m (G)} - D} (x)} φ (z) = \sum_{z \in V (G)} φ (z) - \sum_{z \in N_{D} (x)} φ (z) \\ = \sum_{z \in V (G)} φ (z) - φ (y) - \sum_{z \in N_{D} (x) - {y}} φ (z), \end{aligned}$ and $\begin{aligned} w t (y) & = \sum_{z \in N_{D^{c}} (y)} φ (z) = \sum_{z \in N_{{0, 1, \dots, d i a m (G)} - D} (y)} φ (z) = \sum_{z \in V (G)} φ (z) - \sum_{z \in N_{D} (y)} φ (z) \\ = \sum_{z \in V (G)} φ (z) - φ (x) - \sum_{z \in N_{D} (y) - {x}} φ (z) . \end{aligned}$

Since $w t (x) \neq w t (y)$ and $\sum_{z \in N_{D} (x) - {y}} φ (z) = \sum_{z \in N_{D} (y) - {x}} φ (z)$ then $φ (x) \neq φ (y)$ .

Theorem 2.8. Let $G$ be a graph, $D = D^{'} \cup D^{″}$ , $D^{'} \cap D^{″} = \emptyset$ , and $s_{D} (G) < \infty$ . Let $x, y$ be two distinct vertices of $G$ such that $x \notin N_{D} (y)$ and $y \notin N_{D} (x)$ . If $N_{D^{'}} (x) = N_{D^{'}} (y)$ , $N_{D^{″}} (x) \neq N_{D^{″}} (y)$ and $| N_{D^{″}} (x) | = | N_{D^{″}} (y) | = 1$ then vertices in $N_{D^{″}} (x)$ and $N_{D^{″}} (y)$ must receive distinct labels in any $D$ -irregular labeling of $G$ .

Proof. Let $x, y$ be two distinct vertices of $G$ with $x \notin N_{D} (y)$ and $y \notin N_{D} (x)$ such that $N_{D^{'}} (x) = N_{D^{'}} (y)$ , $N_{D^{″}} (x) \neq N_{D^{″}} (y)$ and $| N_{D^{″}} (x) | = | N_{D^{″}} (y) | = 1$ . Let $N_{D^{″}} (x) = {x^{'}}$ and $N_{D^{″}} (y) = {y^{'}}$ , where $x^{'} \neq y^{'}$ . Then, in any $D$ -irregular labeling $φ$ of $G$ , $\begin{aligned} w t (x) & = \sum_{z \in N_{D} (x)} φ (z) = \sum_{z \in N_{D^{'} \cup D^{″}} (x)} φ (z) = \sum_{z \in N_{D^{'}} (x)} φ (z) + \sum_{z \in N_{D^{″}} (x)} φ (z) \\ = \sum_{z \in N_{D^{'}} (x)} φ (z) + φ (x^{'}), \end{aligned}$ and $\begin{aligned} w t (y) & = \sum_{z \in N_{D} (y)} φ (z) = \sum_{z \in N_{D^{'} \cup D^{″}} (y)} φ (z) = \sum_{z \in N_{D^{'}} (y)} φ (z) + \sum_{z \in N_{D^{″}} (y)} φ (z) \\ = \sum_{z \in N_{D^{'}} (y)} φ (z) + φ (y^{'}) . \end{aligned}$

Since $w t (x) \neq w t (y)$ and $\sum_{z \in N_{D^{'}} (x)} φ (z) = \sum_{z \in N_{D^{'}} (y)} φ (z)$ then $φ (x^{'}) \neq φ (y^{'})$ .

Notice that when $D = {1}$ , Theorem 2.7 yields the result mentioned in [18, Observation 2], and also when $D = {0, 1}$ , $D^{'} = {1}$ , and $D^{″} = {0}$ , Theorem 2.8 provides the property proved in [4, Lemma 3.1].

In [16], Simanjuntak et al. defined a distance- $D$ graph of a graph $G$ , denoted by $G_{D}$ , as a simple graph with the same vertices as $G$ , where two vertices are adjacent if their distance in $G$ is an element of $D$ . Note that, since $G_{D}$ is a simple graph, any loops that would arise when $0 \in D$ are excluded from the graph.

Theorem 2.9. Let $G$ be a graph.

If $D$ does not contain $0$ then $s_{{1}} (G_{D}) = s_{D} (G)$ .
If $D$ contains $0$ then $s_{{0, 1}} (G_{D}) = s_{D} (G)$ .

Proof. Let $φ$ be a $D$ -irregular $s_{D} (G)$ -labeling of a graph $G$ . We define a vertex labeling $φ^{'}$ of $G_{D}$ in the following way. $φ^{'} (x^{'}) = φ (x),$ for any vertex $x^{'} \in V (G_{D})$ corresponding to a vertex $x \in V (G)$ .

If $0 \notin D$ , then we have $\sum_{y \in N (x^{'})} φ^{'} (y) = \sum_{y \in N_{D} (x)} φ (y),$ which implies that $s_{{1}} (G_{D}) ⩽ s_{D} (G)$ . Using similar arguments, we can also show that $s_{D} (G) ⩽ s_{{1}} (G_{D})$ , so $s_{{1}} (G_{D}) = s_{D} (G)$ . This proves (1).

Furthermore, if $0 \in D$ then $φ^{'} (x) + \sum_{y \in N (x^{'})} φ^{'} (y) = \sum_{y \in N_{D} (x)} φ (y),$ which leads to $s_{{0, 1}} (G_{D}) ⩽ s_{D} (G)$ . Again, using similar reasoning, we can demonstrate that $s_{D} (G) ⩽ s_{{0, 1}} (G_{D})$ , thus $s_{{0, 1}} (G_{D}) = s_{D} (G)$ . This completes the proof of (2).

3. Graphs with small diameter

This section showcases the $D$ -irregularity strength for families of graphs with diameter at most three, including complete graphs, the join graph $G + K_{1}$ , complete bipartite graphs, and double stars, for all possible sets $D$ .

A complete graph $K_{n}$ is the graph with $n$ vertices in which any two of them are joined by an edge. Evidently, the graph $K_{1}$ is the only graph of diameter zero, and the graph $K_{n}$ , $n ⩾ 2$ , is the only graph with diameter one.

A complete bipartite graph $K_{m, n}$ is the graph whose vertices can be partitioned into two subsets $X$ and $Y$ with $| X | = m$ and $| Y | = n$ , such that $x y$ is an edge if and only if $x \in X$ and $y \in Y$ . The graph $K_{m, n}$ , $1 ⩽ m ⩽ n$ , $(m, n) \neq (1, 1)$ , has diameter two. The complete bipartite graph $K_{1, n}$ is called a star, the only tree with diameter two.

The join product between two given graphs $G$ and $H$ , denoted by $G + H$ , is the graph obtained from $G$ and $H$ by joining an edge from every vertex of $G$ to every vertex of $H$ . The graph $G + H$ has diameter one or two, with diameter one if and only if $G$ and $H$ are complete graphs. Therefore, the graph $G + K_{1}$ has diameter two if and only if $G$ is not a complete graph.

A double star $S_{m, n}$ is the graph obtained from two stars $K_{1, m}$ and $K_{1, n}$ by connecting the two vertices of degrees $m$ and $n$ in $K_{1, m}$ and $K_{1, n}$ , respectively. The graph $S_{m, n}$ , $1 ⩽ m ⩽ n$ , is the only tree with diameter three.

We first examine complete graphs. It is evident that $s_{D} (K_{1}) = 1$ . We shall show that $K_{1}$ is the only graph with $D$ -irregularity strength one. Beforehand, let us prove in the next proposition a generalization of the well-known property that a simple graph on $n ⩾ 2$ vertices whose all the vertex degrees are distinct does not exist.

Theorem 3.1. There is no simple graph on $n ⩾ 2$ vertices whose vertex $D$ -degrees are all distinct.

Proof. Assume that such a graph $G$ exists. Note that the $D$ -degree of a vertex is at least $0$ and at most $n$ . Thus, $n$ numbers in the set ${0, 1, \dots, n}$ have to be the $D$ -degree of vertices of $G$ .

We will show that $n$ cannot be a vertex $D$ -degree. Assume otherwise, that $d_{D} (x) = n$ for some vertex $x \in V (G)$ . This means that $N_{D} (x) = V (G)$ , which forces $G$ to be connected and $D = {0, 1, \dots, d i a m (G)}$ . But then, this implies that $N_{D} (y) = V (G)$ for any vertex $y \neq x \in V (G)$ , and so $N_{D} (x) = N_{D} (y)$ , a contradiction. Therefore the vertex $D$ -degrees of $G$ must be $0, 1, \dots, n - 1$ .

Consider two distinct vertices $x, y \in V (G)$ with $d_{D} (x) = 0$ and $d_{D} (y) = n - 1$ . Since $d_{D} (x) = 0$ , we get $0 \notin D$ . This implies that $N_{D} (y) = V (G) - {y}$ , and so $x \in N_{D} (y)$ . However, this is impossible since $d_{D} (x) = 0$ . Hence, the statement holds.

From Proposition 3.1 it follows that for any graph $G$ of order $n ⩾ 2$ , labeling all vertices of $G$ with $1$ will always result in at least two vertices with the same weight. This brings us to the characterization of graphs with $D$ -irregularity strength one.

Theorem 3.2. Let

G

be a graph. Then

s_{D} (G) = 1

if and only if

G ≅ K_{1}

Question 3.3. Characterize all graphs with

D

-irregularity strength two.

For $n ⩾ 2$ , the $D$ -irregularity strength of the complete graph $K_{n}$ which can be directly derived from Proposition 2.5 and Corollary 2.2, is presented in the following theorem. Note that the cases when $D = {1}$ and $D = {0, 1}$ were also proved in [18] and [4], respectively.

Theorem 3.4 ([4,18]). Let $K_{n}$ be a complete graph for $n ⩾ 2$ . Then $s_{D} (K_{n}) = {\begin{cases} n & if D \in {{0}, {1}}, \\ \infty & if D = {0, 1} . \end{cases}$

Next, we deal with the join graph $G + K_{1}$ . To begin, let us restate the results on $s_{D} (G + K_{1})$ for $D = {1}$ and $D = {0, 1}$ .

Theorem 3.5. ([22]). Let $G$ be a graph. If $s_{{1}} (G) = \infty$ then $s_{{1}} (G + K_{1}) = \infty$ . Moreover, if $s_{{1}} (G) < \infty$ then $s_{{1}} (G + K_{1}) = {\begin{cases} s_{{1}} (G) & if there exists a {1} -irregular s_{{1}} (G) -labeling φ of G \\ such that \sum_{x \in V (G)} φ (x) > max {w t (x) : x \in V (G)} + 1, \\ s_{{1}} (G) + 1 & otherwise . \end{cases}$

Theorem 3.6 ([4]). Let $G$ be a graph with maximum degree $Δ (G)$ . Then $s_{{0, 1}} (G + K_{1}) = {\begin{cases} s_{{0, 1}} (G) & if Δ (G) < | V (G) | - 1, \\ \infty & if Δ (G) = | V (G) | - 1. \end{cases}$

Corollary 2.2, Proposition 2.5, and Theorems 2.3, 3.5 and 3.6 allow us to completely obtained exact values on $D$ -irregularity strength for the graph $G + K_{1}$ .

Theorem 3.7. Let

G

be a not complete graph on

n ⩾ 2

vertices with maximum degree

Δ (G)

. Then

If $D \in {{0}, {1, 2}}$ then $s_{D} (G + K_{1}) = n + 1$ .
If one of the following conditions is satisfied:
- $D \in {{2}, {0, 1}}$ and $Δ (G) < | V (G) | - 1$ , or
- $D \in {{1}, {0, 2}}$ and there exists a ${1}$ -irregular $s_{{1}} (G)$ -labeling $φ$ of $G$ such that $\sum_{x \in V (G)} φ (x) > max {w t (x) : x \in V (G)} + 1$ ,
then $s_{D} (G + K_{1}) = s_{D} (G)$ .
If $D \in {{1}, {0, 2}}$ and $\sum_{x \in V (G)} φ (x) = max {w t (x) : x \in V (G)} + 1$ for every ${1}$ -irregular $s_{{1}} (G)$ -labeling $φ$ of $G$ , then $s_{D} (G + K_{1}) = s_{D} (G) + 1$ .
If one of the following conditions is satisfied:
- $D \in {{1}, {0, 2}}$ and $s_{D} (G) = \infty$ ,
- $D \in {{2}, {0, 1}}$ and $Δ (G) = | V (G) | - 1$ , or
- $D = {0, 1, 2}$ ,
then $s_{D} (G + K_{1}) = \infty$ .

Now, consider the complete bipartite graph $K_{m, n}$ for $1 ⩽ m ⩽ n$ , $(m, n) \neq (1, 1)$ . By Proposition 2.5, it is clear that $s_{{0}} (K_{m, n}) = s_{{1, 2}} (K_{m, n}) = m + n$ . From [4, Theorem 3.1] and Theorem 2.3, we know that $s_{{0, 1}} (K_{m, n}) = s_{{2}} (K_{m, n}) = n$ when $m < n$ , and $s_{{0, 1}} (K_{m, n}) = s_{{2}} (K_{m, n}) = n + 2$ when $m = n ⩾ 2$ . Moreover, $s_{D} (K_{m, n}) = \infty$ whenever $D \in {{1}, {0, 2}, {0, 1, 2}}$ , which follows immediately from [18, Observation 1], Theorem 2.3 and Corollary 2.2. Thus, we arrive at the following theorem.

Theorem 3.8 [4,18] Let

K_{m, n}

be a complete bipartite graph for

1 ⩽ m ⩽ n

(m, n) \neq (1, 1)

. Then

s_{D} (K_{m, n}) = {\begin{cases} m + n & if D \in {{0}, {1, 2}}, \\ n & if D \in {{2}, {0, 1}} and m < n, \\ n + 2 & if D \in {{2}, {0, 1}} and m = n ⩾ 2, \\ \infty & if D \in {{1}, {0, 2}, {0, 1, 2}} . \end{cases}

Corollary 3.9. Let $K_{1, n}$ be a star for $n ⩾ 2$ . Then $s_{D} (K_{1, n}) = {\begin{cases} n + 1 & if D \in {{0}, {1, 2}}, \\ n & if D \in {{2}, {0, 1}}, \\ \infty & if D \in {{1}, {0, 2}, {0, 1, 2}} . \end{cases}$

We now focus on the double star. Let us denote the vertex and edge set of the double star $S_{m, n}$ respectively by $V (S_{m, n}) = {x, x_{i} : i = 1, 2, \dots, m} \cup {y, y_{j} : j = 1, 2, \dots, n}$ and $E (S_{m, n}) = {x y} \cup {x x_{i} : i = 1, 2, \dots, m} \cup {y y_{j} : j = 1, 2, \dots, n}$ .

Theorem 3.10 ([6]) Let $S_{m, n}$ be a double star for $1 ⩽ m ⩽ n$ . Then $s_{{0, 1}} (S_{m, n}) = {\begin{cases} n & if m < n, \\ n + 1 & otherwise . \end{cases}$

Lemma 3.11. If $D \in {{1}, {0, 2, 3}}$ then $s_{D} (S_{1, 1}) = 2$ .

Proof. Obviously, $s_{{1}} (S_{1, 1}) = 2$ . Combining this with Theorem 2.3, $s_{{0, 2, 3}} (S_{1, 1}) = 2$ .

Lemma 3.12. Let $S_{m, n}$ be a double star for $1 ⩽ m < n$ . If $D \in {{0, 1}, {0, 3}, {1, 2}, {2, 3}}$ then $s_{D} (S_{m, n}) = n$ .

Proof. From Theorems 2.3 and 3.10, we get $s_{{0, 1}} (S_{m, n}) = s_{{2, 3}} (S_{m, n}) = n$ . Let $D = {0, 3}$ . By Theorem 2.8, $y_{i}$ and $y_{j}$ , $i \neq j$ , must receive distinct labels, thus $s_{{0, 3}} (S_{m, n}) ⩾ n$ . Define a labeling $φ : V (S_{m, n}) \to {1, 2, \dots, n}$ such that $\begin{aligned} φ (x) & = 1, \\ φ (y) & = 2, \\ φ (x_{i}) & = i for i = 1, 2, \dots, m, \\ φ (y_{j}) & = j for j = 1, 2, \dots, n . \end{aligned}$

It is easy to see that all vertex labels are at most $n$ . For the vertex weights we have $\begin{aligned} w t (x) & = 1, \\ w t (y) & = 2, \\ w t (x_{i}) & = \frac{n (n + 1)}{2} + i for i = 1, 2, \dots, m, \\ w t (y_{j}) & = \frac{m (m + 1)}{2} + j for j = 1, 2, \dots, n . \end{aligned}$

As $m < n$ , we get that $\frac{m (m + 1)}{2} + n < \frac{n (n + 1)}{2} + 1$ , which implies that the vertex weights are all distinct. Therefore $s_{{0, 3}} (S_{m, n}) = n$ . By combining this with Theorem 2.3 we also have $s_{{1, 2}} (S_{m, n}) = n$ .

Lemma 3.13. Let $S_{m, n}$ be a double star for $1 ⩽ m ⩽ n$ . If one of the following conditions holds:

$D \in {{2}, {0, 1, 3}}$ and $m < n$ , or
$D \in {{0, 1}, {2, 3}}$ and $m = n$ ,

then $s_{D} (S_{m, n}) = n + 1$ .

Proof. Let $D = {2}$ and $m < n$ . Suppose that $φ$ is a ${2}$ -irregular labeling of $S_{m, n}$ . By Theorem 2.7, $φ (y_{i}) \neq φ (y_{j})$ for $i \neq j$ , so $s_{{2}} (S_{m, n}) ⩾ n$ .

Assume that $s_{{2}} (S_{m, n}) = n$ . Then ${φ (y_{j}) : j = 1, 2, \dots, n} = {1, 2, \dots, n}$ , which leads to $w t (x) = \frac{n (n + 1)}{2}$ and ${w t (y_{j}) : j = 1, 2, \dots, n} = {\frac{n (n + 1)}{2} - n + φ (x), \frac{n (n + 1)}{2} - n + 1 + φ (x), \dots, \frac{n (n + 1)}{2} - 1 + φ (x)}$ . As $1 ⩽ φ (x) ⩽ n$ , the vertex weights are not distinct. Therefore, $s_{{2}} (S_{m, n}) ⩾ n + 1$ .

Let $φ$ be a vertex labeling of $S_{m, n}$ defined such that $\begin{aligned} φ (x) & = n + 1, \\ φ (y) & = n, \\ φ (x_{i}) & = i for i = 1, 2, \dots, m, \\ φ (y_{j}) & = j for j = 1, 2, \dots, n . \end{aligned}$

Then we obtain the vertex weights as follows. $\begin{aligned} w t (x) & = \frac{n (n + 1)}{2}, \\ w t (y) & = \frac{m (m + 1)}{2}, \\ w t (x_{i}) & = \frac{m (m + 1)}{2} + n - i for i = 1, 2, \dots, m, \\ w t (y_{j}) & = \frac{n (n + 1)}{2} + n + 1 - j for j = 1, 2, \dots, n . \end{aligned}$

It is not difficult to verify that the vertex weights are distinct and the labels used in the labeling $φ$ are not greater than $n + 1$ , which means that $φ$ is a ${2}$ -irregular $(n + 1)$ -labeling of $S_{m, n}$ for $m < n$ . Hence $s_{{2}} (S_{m, n}) = n + 1$ . Furthermore, combining this with Theorem 2.3 we also have $s_{{0, 1, 3}} (S_{m, n}) = n + 1$ for $m < n$ .

Next, we have $s_{{0, 1}} (S_{n, n}) = s_{{2, 3}} (S_{n, n}) = n + 1$ by Theorems 2.3 and 3.10.

Lemma 3.14. Let $S_{n, n}$ be a double star for $n ⩾ 2$ . If $D \in {{0, 3}, {1, 2}}$ then $s_{D} (S_{n, n}) = n + 2$ .

Proof. Let $D = {0, 3}$ . Define a vertex labeling $φ : V (S_{n, n}) \to {1, 2, \dots, n + 2}$ of $S_{n, n}$ in the following way: $\begin{aligned} φ (x) & = 1, \\ φ (y) & = 2, \\ φ (x_{i}) & = i for i = 1, 2, \dots, n, \\ φ (y_{i}) & = i + 2 for i = 1, 2, \dots, n . \end{aligned}$

Obviously, the largest label that appears on the vertices is $n + 2$ . Moreover, we have the following vertex weights. $\begin{aligned} w t (x) & = 1, \\ w t (y) & = 2, \\ w t (x_{i}) & = \frac{n (n + 5)}{2} + i for i = 1, 2, \dots, n, \\ w t (y_{i}) & = \frac{n (n + 1)}{2} + i + 2 for i = 1, 2, \dots, n . \end{aligned}$

It is easy to see that the vertex weights are distinct. Therefore $s_{{0, 3}} (S_{n, n}) ⩽ n + 2$ .

Next, we shall show that $s_{{0, 3}} (S_{n, n}) ⩾ n + 2$ . For a contradiction, assume that there is a ${0, 3}$ -irregular $(n + 1)$ -labeling $φ$ of $S_{n, n}$ for $n ⩾ 2$ . Then by Theorem 2.8, the following properties hold:

$φ (x_{i}) \neq φ (x_{j})$ for $i \neq j$ , and
$φ (y_{i}) \neq φ (y_{j})$ for $i \neq j$ .

We may assume, without loss of generality, that ${φ (x_{i}) : i = 1, 2, \dots, n} = {1, 2, \dots, n}$ and ${φ (y_{i}) : i = 1, 2, \dots, n} = {1, 2, \dots, n + 1} - {r}$ , where $1 ⩽ r ⩽ n$ . Then $\begin{aligned} {w t (x_{i}) : i = 1, 2, \dots, n} = & {\frac{n (n + 1)}{2} + n + 2 - r, \frac{n (n + 1)}{2} + n + 3 - r, \dots, \frac{n (n + 1)}{2} \\ + 2 n + 1 - r}, \end{aligned}$ and $\begin{aligned} {w t (y_{i}) : i = 1, 2, \dots, n} = & {\frac{n (n + 1)}{2} + 1, \frac{n (n + 1)}{2} + 2, \dots, \frac{n (n + 1)}{2} + n + 1} \\ - {\frac{n (n + 1)}{2} + r} . \end{aligned}$

Since these sets are not disjoint, the vertex weights are not distinct, a contradiction. Thus $s_{{0, 3}} (S_{n, n}) ⩾ n + 2$ .

As $n + 2 ⩽ s_{{0, 3}} (S_{n, n})$ and $s_{{0, 3}} (S_{n, n}) ⩽ n + 2$ we conclude that $s_{{0, 3}} (S_{n, n}) = n + 2$ . Furthermore, combining this with Theorem 2.3 we get $s_{{1, 2}} (S_{n, n}) = n + 2$ .

Lemma 3.15. Let $S_{n, n}$ be a double star for $n ⩾ 1$ . If $D \in {{2}, {0, 1, 3}}$ then $s_{D} (S_{n, n}) = n + 3$ .

Proof. Let $D = {2}$ . Define a vertex labeling $φ : V (S_{n, n}) \to {1, 2, \dots, n + 3}$ of $S_{n, n}$ in the following way: $\begin{aligned} φ (x) & = n + 3, \\ φ (y) & = n + 1, \\ φ (x_{i}) & = i for i = 1, 2, \dots, n, \\ φ (y_{i}) & = i + 2 for i = 1, 2, \dots, n . \end{aligned}$ Then we get the following vertex weights. $\begin{aligned} w t (x) & = \frac{n (n + 5)}{2}, \\ w t (y) & = \frac{n (n + 1)}{2}, \\ w t (x_{i}) & = \frac{(n + 1) (n + 2)}{2} - i for i = 1, 2, \dots, n, \\ w t (y_{i}) & = \frac{n (n + 7)}{2} + 1 - i for i = 1, 2, \dots, n . \end{aligned}$

It is not hard to show that the vertex weights are distinct and the labels used in the labeling $φ$ are at most $n + 3$ . This means that $φ$ is a ${2}$ -irregular $(n + 3)$ -labeling of $S_{n, n}$ for $n ⩾ 1$ . Therefore $s_{{2}} (S_{n, n}) ⩽ n + 3$ .

Next, we shall show that $s_{{2}} (S_{n, n}) ⩾ n + 3$ . For a contradiction, assume that there exists a ${2}$ -irregular $(n + 2)$ -labeling $φ$ of $S_{n, n}$ for $n ⩾ 1$ . Using Theorem 2.7, the following properties must be hold:

$φ (y) \neq φ (x_{i}) \neq φ (x_{j})$ for $i \neq j$ , and
$φ (x) \neq φ (y_{i}) \neq φ (y_{j})$ for $i \neq j$ .

Without loss of generality we may assume that ${φ (y), φ (x_{i}) : i = 1, 2, \dots, n} = {1, 2, \dots, n + 1}$ and ${φ (x), φ (y_{i}) : i = 1, 2, \dots, n} = {1, 2, \dots, n + 2} - {r}$ , where $1 ⩽ r ⩽ n + 1$ . Then $\begin{aligned} {w t (y), w t (x_{i}) : i = 1, 2, \dots, n} = & {\frac{(n + 1) (n + 2)}{2} - n - 1, \frac{(n + 1) (n + 2)}{2} - n, \dots, \\ \frac{(n + 1) (n + 2)}{2} - 1} \end{aligned}$ and $\begin{aligned} {w t (x), w t (y_{i}) : i = 1, 2, \dots, n} = & {\frac{(n + 1) (n + 2)}{2} - r, \frac{(n + 1) (n + 2)}{2} - r + 1, \dots, \\ \frac{(n + 1) (n + 2)}{2} - r + n + 1} {\frac{(n + 1) (n + 2)}{2} + n \\ + 2 - 2 r}, \end{aligned}$ which implies that the vertex weights are not distinct, a contradiction. Therefore $s_{{2}} (S_{n, n}) ⩾ n + 3$ .

Since $n + 3 ⩽ s_{{2}} (S_{n, n}) ⩽ n + 3$ , we get $s_{{2}} (S_{n, n}) = n + 3$ for $n ⩾ 1$ . Moreover, combining this with Theorem 2.3 we also obtain $s_{{0, 1, 3}} (S_{n, n}) = n + 3$ for $n ⩾ 1$ .

In the next theorem, we present $D$ -irregularity strength for the double stars.

Theorem 3.16. Let $S_{m, n}$ be a double star for $1 ⩽ m ⩽ n$ . Then

If $D \in {{1}, {0, 2, 3}}$ then $s_{D} (S_{1, 1}) = 2$ .
If $D \in {{0, 1}, {0, 3}, {1, 2}, {2, 3}}$ and $m < n$ then $s_{D} (S_{m, n}) = n$ .
If one of the following conditions is satisfied:
- $D \in {{2}, {0, 1, 3}}$ and $m < n$ , or
- $D \in {{0, 1}, {2, 3}}$ and $m = n$ ,
then $s_{D} (S_{m, n}) = n + 1$ .
If $D \in {{0, 3}, {1, 2}}$ and $m = n ⩾ 2$ then $s_{D} (S_{m, n}) = n + 2$ .
If $D \in {{2}, {0, 1, 3}}$ and $m = n$ then $s_{D} (S_{m, n}) = n + 3$ .
If $D \in {{0}, {1, 2, 3}}$ then $s_{D} (S_{m, n}) = m + n + 2$ .
If one of the following conditions is satisfied:
- $D \in {{3}, {0, 2}, {1, 3}, {0, 1, 2}, {0, 1, 2, 3}}$ ,
- $D \in {{1}, {0, 2, 3}}$ and $(m, n) \neq (1, 1)$ , or
- $D \in {{0, 3}, {1, 2}}$ and $m = n = 1$ ,
then $s_{D} (S_{m, n}) = \infty$ .

Proof. (1)-(5) follow from Lemmas 3.11, 3.12, 3.13, 3.14 and 3.15, respectively. Similarly, (6)-(7) are derived by applying Proposition 2.5, and Theorems 2.1 and 2.3.

It is worth noting that, from Theorems 3.4 and 3.16, along with Corollary 3.9, we have fully characterized the $D$ -irregularity strength for all non-trivial trees with diameter at most three, for all possible sets $D$ .

Question 3.17. Find the $D$ -irregularity strength of all trees with diameter four for all possible $D$ s.

4. Graphs with small maximum degree

This section explores the ${d}$ -irregularity strength of certain graphs with maximum degree two, focusing particularly on the disjoint union of paths and $2$ -regular graphs, for a positive integer $d$ .

We begin by examining the ${d}$ -irregularity strength of the disjoint union of paths $m P_{n}$ for $m ⩾ 1$ and $n ⩾ 2$ . For $d = 1$ , the following theorem, established in [18,20], provides the result.

Theorem 4.1 [18,20]. Let $m P_{n}$ be an $m$ disjoint union of a path on $n$ vertices for $m ⩾ 1$ and $n ⩾ 2$ . Then $s_{{1}} (m P_{n}) = {\begin{cases} 2 m & if n = 2, \\ \infty & if n = 3, \\ ⌈ \frac{m n}{2} ⌉ & if n ⩾ 4. \end{cases}$

In the next theorem, we determine ${d}$ -irregularity strength of $m P_{n}$ for certain $d ⩾ 2$ .

Theorem 4.2. Let $m P_{n}$ be an $m$ disjoint union of a path on $n$ vertices for $m ⩾ 1$ and $n ⩾ 2$ , and let $2 ⩽ d ⩽ n - 1$ . Then

$s_{{\frac{n}{2}}} (m P_{n}) = m n$ .

For $d \in {\frac{n}{k} : 4 ⩽ k ⩽ \frac{n}{2}}$ , $s_{{d}} (m P_{n}) = ⌈ \frac{m n}{2} ⌉$ .

$s_{{d}} (m P_{n}) = \infty$ if and only if $d = {\begin{cases} \frac{n}{3} & if n \equiv 0 (mod d), \\ \frac{n - t}{3} or \frac{n - t}{2} & if n \equiv t (mod d), 0 < t < d, \\ n - t & if n \equiv t (mod d), 0 < t < d, and m (n - 2 t) ⩾ 2. \end{cases}$

Proof. (1) Evidently, $(m P_{n})_{{\frac{n}{2}}} ≅ \frac{m n}{2} K_{2}$ . Then by Theorem 2.9, we have $s_{{\frac{n}{2}}} (m P_{n}) = s_{{1}} (\frac{m n}{2} K_{2}) = m n$ .

(2) If $d \in {\frac{n}{k} : 4 ⩽ k ⩽ \frac{n}{2}}$ then $(m P_{n})_{{d}} ≅ m d P_{\frac{n}{d}} ≇ \frac{m n}{2} P_{2} ≇ \frac{m n}{3} P_{3}$ . By Theorems 2.9 and 4.1, $s_{{d}} (m P_{n}) = s_{{1}} (m d P_{\frac{n}{d}}) = ⌈ \frac{m n}{2} ⌉ .$

(3) From Theorem 2.9 we know that $s_{{d}} (m P_{n}) = \infty$ if and only if $s_{{1}} ((m P_{n})_{{d}}) = \infty$ . Furthermore, by Theorem 2.1 we have that $s_{{1}} ((m P_{n})_{{d}}) = \infty$ if and only if $(m P_{n})_{{d}}$ contains at least one component isomorphic to $P_{3}$ or at least two components isomorphic to $P_{1}$ . Thus, $s_{{d}} (m P_{n}) = \infty$ if and only if $(m P_{n})_{{d}}$ has at least one component isomorphic to $P_{3}$ or at least two components isomorphic to $P_{1}$ .

We have that $(m P_{n})_{{d}} = {\begin{cases} m d P_{\frac{n}{d}} & if n \equiv 0 (mod d), \\ m (d - t) P_{\frac{n - t}{d}} \cup m t P_{\frac{n - t + d}{d}} & if n \equiv t (mod d), 0 < t < d . \end{cases}$

Clearly, $(m P_{n})_{{d}}$ contains at least one component isomorphic to $P_{3}$ if and only if $d = {\begin{cases} \frac{n}{3} & if n \equiv 0 (mod d), \\ \frac{n - t}{3} or \frac{n - t}{2} & if n \equiv t (mod d), 0 < t < d, \end{cases}$ and $(m P_{n})_{{d}}$ has at least two components isomorphic to $P_{1}$ if and only if $n \equiv t (mod d)$ , $0 < t < d$ , $d = n - t$ and $m (n - 2 t) ⩾ 2$ . Therefore, combining both conditions, we conclude that $s_{{d}} (m P_{n}) = \infty$ if and only if $d = {\begin{cases} \frac{n}{3} & if n \equiv 0 (mod d), \\ \frac{n - t}{3} or \frac{n - t}{2} & if n \equiv t (mod d), 0 < t < d, \\ n - t & if n \equiv t (mod d), 0 < t < d, and m (n - 2 t) ⩾ 2. \end{cases}$

Question 4.3. Find ${d}$ -irregularity strength of $m P_{n}$ for other values of $d ⩾ 2$ not covered in Theorem 4.2.

Next, we address the ${d}$ -irregularity strength for $2$ -regular graphs, i.e., the disjoint union of cycles. To achieve this, we first employ the irregularity strength and edge irregularity strength of $2$ -regular graphs to obtain ${1}$ -irregularity strength of $2$ -regular graphs. Subsequently, we use Theorem 2.9 to derive the ${d}$ -irregularity strength of $2$ -regular graphs. Recall that the edge irregularity strength of a graph $G$ , denoted by $e s (G)$ , is the minimum $k$ such that an assignment of integers $1, 2, \dots, k$ to the vertices of $G$ implies that distinct edges have distinct weights, where the edge weight is the sum of labels of its two end vertices [1].

We begin by stating the theorem of Faudree et al. [10], which determines the irregularity strength of $2$ -regular graphs.

Theorem 4.4. ([10]). Let $G$ be a $2$ -regular graph on $n$ vertices. Then $⌊ \frac{n}{2} ⌋ ⩽ s (G) ⩽ ⌊ \frac{n}{2} ⌋ + 2.$ Moreover,

If $G$ is the disjoint union of triangles $\frac{n}{3} C_{3}$ then $s (\frac{n}{3} C_{3}) = {\begin{cases} ⌈ \frac{n}{2} ⌉ + 1 & if n \equiv 3 (m o d 4), \\ ⌈ \frac{n}{2} ⌉ + 2 & otherwise . \end{cases}$

If $G$ has no triangle then $s (G) = {\begin{cases} ⌈ \frac{n}{2} ⌉ & if n \equiv 1 (m o d 4), \\ ⌈ \frac{n}{2} ⌉ + 1 & otherwise . \end{cases}$

In the next theorem, we prove that the irregularity strength and the edge irregularity strength of $2$ -regular graphs are equivalent.

Theorem 4.5. Let $G$ be a $2$ -regular graph on $n$ vertices. Then $e s (G) = s (G)$ . Consequently, $⌊ \frac{n}{2} ⌋ ⩽ e s (G) ⩽ ⌊ \frac{n}{2} ⌋ + 2.$ Moreover,

If $G$ is the disjoint union of triangles $\frac{n}{3} C_{3}$ then $e s (\frac{n}{3} C_{3}) = {\begin{cases} ⌈ \frac{n}{2} ⌉ + 1 & if n \equiv 3 (m o d 4), \\ ⌈ \frac{n}{2} ⌉ + 2 & otherwise . \end{cases}$

If $G$ has no triangle then $e s (G) = {\begin{cases} ⌈ \frac{n}{2} ⌉ & if n \equiv 1 (m o d 4), \\ ⌈ \frac{n}{2} ⌉ + 1 & otherwise . \end{cases}$

Proof. Let $G$ be a $2$ -regular graph on $n$ vertices. In any edge irregular labeling of $G$ , if we shift the label of each vertex to the edge incident to it in the clockwise direction, we obtain an irregular labeling of $G$ . This demonstrates that $e s (G) ⩾ s (G)$ . Conversely, in any irregular labeling of $G$ , shifting the label of each edge to the vertex incident to it in the clockwise direction results in an edge irregular labeling of $G$ , implying that $e s (G) ⩽ s (G)$ . Consequently, $e s (G) = s (G)$ . The rest of the theorem follows immediately from Theorem 4.4.

Let $G ≅ m C_{3} \cup (G - m C_{3})$ be a $2$ -regular graph on $n$ vertices containing $m$ triangles and no square. Evidently, $m C_{3} \cup (G - m C_{3})_{{2}}$ is a $2$ -regular graph with $n$ vertices. Moreover, it is not hard to know that every ${1}$ -irregular labeling of $G$ induces an edge irregular labeling of $m C_{3} \cup (G - m C_{3})_{{2}}$ , and every edge irregular labeling of $m C_{3} \cup (G - m C_{3})_{{2}}$ induces a ${1}$ -irregular labeling of $G$ , meaning that ${1}$ -irregularity strength of $G$ and edge irregularity strength of $m C_{3} \cup (G - m C_{3})_{{2}}$ are equivalent.

Further, if $G ≅ m C_{3} \cup \frac{n - 3 m}{6} C_{6}$ then $m C_{3} \cup (\frac{n - 3 m}{6} C_{6})_{{2}}$ is the disjoint union of triangles $\frac{n}{3} C_{3}$ , and if $m = 0$ and $G$ has no hexagon then $G_{{2}}$ is a $2$ -regular graph without any triangle.

With the above facts in hand along with Theorem 4.5 we obtain the following.

Theorem 4.6. Let $G ≅ m C_{3} \cup (G - m C_{3})$ be a $2$ -regular graph on $n$ vertices containing $m$ triangles and no square for $n ⩾ 3$ and $0 ⩽ m ⩽ \frac{n}{3}$ . Then $s_{{1}} (G) = e s (m C_{3} \cup (G - m C_{3})_{{2}})$ . Consequently, $⌊ \frac{n}{2} ⌋ ⩽ s_{{1}} (G) ⩽ ⌊ \frac{n}{2} ⌋ + 2.$ Moreover,

If $G = m C_{3} \cup \frac{n - 3 m}{6} C_{6}$ then $s_{{1}} (G) = {\begin{cases} ⌈ \frac{n}{2} ⌉ + 1 & if n \equiv 3 (m o d 4), \\ ⌈ \frac{n}{2} ⌉ + 2 & otherwise . \end{cases}$

If $m = 0$ and $G$ has no hexagon then $s_{{1}} (G) = {\begin{cases} ⌈ \frac{n}{2} ⌉ & if n \equiv 1 (m o d 4), \\ ⌈ \frac{n}{2} ⌉ + 1 & otherwise . \end{cases}$

The next theorem provides ${d}$ -irregularity strength of the isomorphic copies of cycles $m C_{n}$ for $1 ⩽ d ⩽ ⌊ \frac{n}{2} ⌋$ .

Theorem 4.7. Let $m C_{n}$ be an $m$ disjoint union of a cycle on $n$ vertices for $m ⩾ 1$ and $n ⩾ 3$ . Then

$s_{{\frac{n}{4}}} (m C_{n}) = \infty$ .

$s_{{\frac{n}{2}}} (m C_{n}) = m n$ .

For $d \in {\frac{n}{6}, \frac{n}{3}}$ , $s_{{d}} (m C_{n}) = {\begin{cases} ⌈ \frac{m n}{2} ⌉ + 1 & if m n \equiv 3 (m o d 4), \\ ⌈ \frac{m n}{2} ⌉ + 2 & otherwise . \end{cases}$

For $d \in ({1, 2, \dots, ⌊ \frac{n}{2} ⌋} - {\frac{n}{6}, \frac{n}{4}, \frac{n}{3}, \frac{n}{2}})$ , $s_{{d}} (m C_{n}) = {\begin{cases} ⌈ \frac{m n}{2} ⌉ & if m n \equiv 1 (m o d 4), \\ ⌈ \frac{m n}{2} ⌉ + 1 & otherwise . \end{cases}$

Proof. By simple observation, $(m C_{n})_{{\frac{n}{4}}} = \frac{m n}{4} C_{4}$ and $(m C_{n})_{{\frac{n}{2}}} = \frac{m n}{2} K_{2}$ . Then by Theorem 2.9, we find that $s_{{\frac{n}{4}}} (m C_{n}) = s_{{1}} (\frac{m n}{4} C_{4}) = \infty$ and $s_{{\frac{n}{2}}} (m C_{n}) = s_{{1}} (\frac{m n}{2} K_{2}) = m n$ . This proves (1) and (2).

Next, let $d \in {\frac{n}{6}, \frac{n}{3}}$ . If $d = \frac{n}{6}$ then $(m C_{n})_{{\frac{n}{6}}} = \frac{m n}{6} C_{6}$ . By Theorems 2.9 and 4.6, we obtain $s_{{\frac{n}{6}}} (m C_{n}) = s_{{1}} (\frac{m n}{6} C_{6}) = {\begin{cases} ⌈ \frac{m n}{2} ⌉ + 1 & if m n \equiv 3 (m o d 4), \\ ⌈ \frac{m n}{2} ⌉ + 2 & otherwise . \end{cases}$ If $d = \frac{n}{3}$ then $(m C_{n})_{{\frac{n}{3}}} = \frac{m n}{3} C_{3}$ . Again, by Theorems 2.9 and 4.6, we have $s_{{\frac{n}{3}}} (m C_{n}) = s_{{1}} (\frac{m n}{3} C_{3}) = {\begin{cases} ⌈ \frac{m n}{2} ⌉ + 1 & if m n \equiv 3 (m o d 4), \\ ⌈ \frac{m n}{2} ⌉ + 2 & otherwise . \end{cases}$ This proves 3.

Now, for $d \in ({1, 2, \dots, ⌊ \frac{n}{2} ⌋} - {\frac{n}{6}, \frac{n}{4}, \frac{n}{3}, \frac{n}{2}})$ , we observe that $(m C_{n})_{{d}}$ is a $2$ -regular graph without any cycle $C_{t}$ for $t = 3, 4, 6$ . By Theorems 2.9 and 4.6, we conclude that $s_{{d}} (m C_{n}) = s_{{1}} ((m C_{n})_{{d}}) = {\begin{cases} ⌈ \frac{m n}{2} ⌉ & if m n \equiv 1 (m o d 4), \\ ⌈ \frac{m n}{2} ⌉ + 1 & otherwise . \end{cases}$ Hence (4) is proved.

Under certain conditions, Theorem 4.7 can be extended to $2$ -regular graphs that contain non-isomorphic cycle components.

Theorem 4.8. Let $G = ⋃_{i = 1}^{m} C_{n_{i}}$ be a $2$ -regular graph on $n = n_{1} + n_{2} + \dots + n_{m}$ vertices with $m ⩾ 2$ components such that $3 ⩽ n_{1} ⩽ n_{2} ⩽ \dots ⩽ n_{m}$ , and $G ≇ m C_{p}$ for some $p ⩾ 3$ . Then

For $d \in ({\frac{n_{i}}{4} ⩽ ⌊ \frac{n_{1}}{2} ⌋ : i = 1, 2, \dots, m} \cup {⌊ \frac{n_{1}}{2} ⌋ + 1, ⌊ \frac{n_{1}}{2} ⌋ + 2, \dots, ⌊ \frac{n_{m}}{2} ⌋})$ , $s_{{d}} (G) = \infty$ .

For $d \in ({\frac{n_{i}}{6}, \frac{n_{i}}{3} ⩽ ⌊ \frac{n_{1}}{2} ⌋ : i = 1, 2, \dots, m} - {\frac{n_{j}}{4}, \frac{n_{j}}{2} : j = 1, 2, \dots, m})$ , $⌊ \frac{n}{2} ⌋ ⩽ s_{{d}} (G) ⩽ ⌊ \frac{n}{2} ⌋ + 2.$ In particular, if $d \in {\frac{n_{i}}{6}, \frac{n_{i}}{3}}$ for some $i$ , and $\frac{n_{j}}{gcd (n_{j}, d)} \in {3, 6}$ for every $j = 1, 2, \dots, m$ , $j \neq i$ , then $s_{{d}} (G) = {\begin{cases} ⌈ \frac{n}{2} ⌉ + 1 & if n \equiv 3 (m o d 4), \\ ⌈ \frac{n}{2} ⌉ + 2 & otherwise . \end{cases}$

For $d \in ({1, 2, \dots, ⌊ \frac{n_{1}}{2} ⌋} - {\frac{n_{j}}{6}, \frac{n_{j}}{4}, \frac{n_{j}}{3}, \frac{n_{j}}{2} : j = 1, 2, \dots, m})$ , $s_{{d}} (G) = {\begin{cases} ⌈ \frac{n}{2} ⌉ & if n \equiv 1 (m o d 4), \\ ⌈ \frac{n}{2} ⌉ + 1 & otherwise . \end{cases}$

Proof. (1) If $d \in {\frac{n_{i}}{4} ⩽ ⌊ \frac{n_{1}}{2} ⌋ : i = 1, 2, \dots, m}$ then $G_{{d}}$ contains a square, and so $s_{{d}} (G) = s_{{1}} (G_{{d}}) = \infty$ . If $d \in {⌊ \frac{n_{1}}{2} ⌋ + 1, ⌊ \frac{n_{1}}{2} ⌋ + 2, \dots, ⌊ \frac{n_{m}}{2} ⌋}$ then $N_{{d}} (x) = N_{{d}} (y) = \emptyset$ for any two distinct vertices $x$ and $y$ in the component $C_{n_{1}}$ , thus $s_{{d}} (G) = \infty$ .

(2) If $d \in ({\frac{n_{i}}{6}, \frac{n_{i}}{3} ⩽ ⌊ \frac{n_{1}}{2} ⌋ : i = 1, 2, \dots, m} - {\frac{n_{j}}{4}, \frac{n_{j}}{2} : j = 1, 2, \dots, m})$ then $G_{{d}} ≅ t C_{3} \cup (G_{{d}} - t C_{3})$ is a $2$ -regular graph of order $n$ containing $t$ triangles and no square for some $t ⩾ 0$ . Therefore, by Theorems 2.9 and 4.6, $⌊ \frac{n}{2} ⌋ ⩽ s_{{d}} (G) = s_{{1}} (G_{{d}}) ⩽ ⌊ \frac{n}{2} ⌋ + 2.$ For some $i$ , let $d \in {\frac{n_{i}}{6}, \frac{n_{i}}{3}}$ , and for every $j = 1, 2, \dots, m$ , $j \neq i$ , let $\frac{n_{j}}{g c d (n_{j}, d)} \in {3, 6}$ . Then $G_{{d}} ≅ m_{1} C_{3} \cup m_{2} C_{6}$ , where $3 m_{1} + 6 m_{2} = n$ . Thus, by Theorems 2.9 and 4.6, $s_{{d}} (G) = s_{{1}} (G_{{d}}) = {\begin{cases} ⌈ \frac{n}{2} ⌉ + 1 & if n \equiv 3 (m o d 4), \\ ⌈ \frac{n}{2} ⌉ + 2 & otherwise . \end{cases}$

(3) If $d \in ({1, 2, \dots, ⌊ \frac{n_{1}}{2} ⌋} - {\frac{n_{j}}{6}, \frac{n_{j}}{4}, \frac{n_{j}}{3}, \frac{n_{j}}{2} : j = 1, 2, \dots, m})$ then $G_{{d}}$ is a $2$ -regular graphs with $n$ vertices containing no cycle $C_{t}$ , $t = 3, 4, 6$ . By Theorems 2.9 and 4.6, $s_{{d}} (G) = s_{{1}} (G_{{d}}) = {\begin{cases} ⌈ \frac{n}{2} ⌉ & if n \equiv 1 (m o d 4), \\ ⌈ \frac{n}{2} ⌉ + 1 & otherwise . \end{cases}$

Question 4.9.Find the ${d}$ -irregularity strength of arbitrary $2$ -regular graphs for other values of $d$ not mentioned in Theorems 4.7 and 4.8.

5. Final remarks

In this work, we introduced a $D$ -irregular labeling as a generalization of non-inclusive and inclusive $d$ -distance irregular labeling of graphs. We derived fundamental properties on $D$ -irregularity strength for arbitrary graphs, and presented exact values on this parameter for specific families of graphs with small diameter or small maximum degree.

The authors of [16] posed a conjecture below.

Conjecture 5.1 ([16]) A graph $G$ is $D$ -antimagic if and only if $N_{D} (x) \neq N_{D} (y)$ for every two distinct vertices $x, y \in V (G)$ .

Note that if Conjecture 5.1 holds, then for a graph $G$ with finite $D$ -irregularity strength, the inequality $s_{D} (G) ⩽ | V (G) |$ holds as well. Motivated by this observation and the results presented in Proposition 2.5, we believe that the following conjecture is true.

Conjecture 5.2 Let $G$ be a graph on $n$ vertices with $s_{D} (G) < \infty$ . Then $s_{D} (G) ⩽ n$ with the equality if and only if one of the following conditions holds:

$G$ is connected and $D \in {{0}, {1, 2, \dots, d i a m (G)}}$ ,

$G ≅ m K_{2}$ , $m ⩾ 2$ , and $D = {{0}, {1}}$ , or

$G$ is disconnected, $G ≇ m K_{2}$ , $m ⩾ 2$ , and $D = {0}$ .

Acknowledgements

This work has been supported by Direktorat Riset, Teknologi, dan Pengabdian kepada Masyarakat, Direktorat Jenderal Pendidikan Tinggi, Riset, dan Teknologi, Kementerian Pendidikan, Kebudayaan, Riset, dan Teknologi Republik Indonesia under the grant “Penelitian Fundamental Reguler 2024” and by Institut Teknologi Bandung under the grant “Program Riset International 2023/2024”. The first author gratefully acknowledges the support provided by the Excellent Scholarship Program of the Indonesian Ministry of Education, Culture, Research, and Technology.

References:

A. Ahmad, O. Al-Mushayt, and M. Bača. On edge irregularity strength of graphs. Applied Mathematics and Computation, 243:607–610, 2014. 10.1016/j.amc.2014.06.028.

M. Bača, M. Imran, and A. Semaničová-Feňovčíková. Irregularity and modular irregularity strength of wheels. Mathematics, 9(21):2710, 2021. 10.3390/math9212710.

M. Bača, Z. Kimáková, M. Lascsáková, and A. Semaničová-Feňovčíková. The irregularity and modular irregularity strength of fan graphs. Symmetry, 13(4):605, 2021. 10.3390/sym13040605.

M. Bača, A. Semaničová-Feňovčíková, Slamin, and K. Sugeng. On inclusive distance vertex irregular labelings. Electronic Journal of Graph Theory and Applications, 6(1):61–83, 2018. 10.5614/ejgta.2018.6.1.5.

N. Bong, Y. Lin, and Slamin. On distance-irregular labelings of cycles and wheels. The Australasian Journal of Combinatorics, 69(3):315–322, 2017.

N. Bong, Y. Lin, and Slamin. On inclusive and non-inclusive vertex irregular d-distance vertex labeling. Journal of Combinatorial Mathematics and Combinatorial Computing, 113:233–247, 2020.

G. Chartrand, M. Jacobson, J. Lehel, O. Oellermann, S. Ruiz, and F. Saba. Irregular networks. Congressus Numerantium, 64:197–210, 1988.

G. Chartrand, L. Lesniak, and P. Zhang. Graphs & digraphs, sixth ed. Taylor & Francis Group, Boca Raton, 2016.

N. Cutinho, S. Sudha, and S. Arumugam. Distance antimagic labelings of Cartesian product of graphs. AKCE International Journal of Graphs and Combinatorics, 17(3):940–942, 2020. 10.1016/j.akcej.2019.08.005.

R. Faudree, R. Schelp, M. Jacobson, and J. Lehel. Irregular networks, regular graphs and integer matrices with distinct row and column sums. Discrete Mathematics, 76(3):223–240, 1989. 10.1016/0012-365X(89)90321-X.

J. Gallian. A dynamic survey of graph labeling. The Electronic Journal of Combinatorics:#DS6, 2023. 10.37236/27.

A. Handa, A. Godinho, and T. Singh. Distance antimagic labeling of the ladder graph. Electronic Notes in Discrete Mathematics, 63:317–322, 2017. 10.1016/j.endm.2017.11.028.

A. Handa, A. Godinho, T. Singh, and S. Arumugam. Distance antimagic labeling of join and corona of two graphs. AKCE International Journal of Graphs and Combinatorics, 14(2):172–177, 2017. 10.1016/j.akcej.2017.04.003.

N. Kamatchi and S. Arumugam. Distance antimagic graphs. Journal of Combinatorial Mathematics and Combinatorial Computing, 84:61–67, 2013.

J. Przybyło. The irregularity strength of dense graphs-on asymptotically optimal solutions of problems of Faudree, Jacobson, Kinch, and Lehel. European Journal of Combinatorics, 104013, 2024. 10.1016/j.ejc.2024.104013.

R. Simanjuntak, T. Nadeak, F. Yasin, K. Wijaya, N. Hinding, and K. Sugeng. Another antimagic conjecture. Symmetry, 13(11):2071, 2021. 10.3390/sym13112071.

R. Simanjuntak and A. Tritama. Distance antimagic product graphs. Symmetry, 14(7):1411, 2022. 10.3390/sym14071411.

Slamin. On distance irregular labelling of graphs. Far East Journal of Mathematical Sciences, 102(5):919–932, 2017. 10.17654/ms102050919.

F. Susanto, C. Betitsiyan, I. Halikin, and K. Wijaya. On inclusive distance vertex irregularity strength of small identical copies of star graphs. Journal of Physics: Conference Series, 1872(1):012005, 2021. 10.1088/1742-6596/1872/1/012005.

F. Susanto, K. Wijaya, P. Purnama, and Slamin. On distance irregular labeling of disconnected graphs. Kragujevac Journal of Mathematics, 46(4):507–523, 2022.

F. Susanto, K. Wijaya, Slamin, and A. Semaničová-Feňovčíková. Distance irregularity strength of graphs with pendant vertices. Opuscula Mathematica, 42(3):439–458, 2022. 10.7494/OpMathematics.2022.42.3.439.

F. Susanto, K. Wijaya, I. Sudarsana, and Slamin. Non-inclusive and inclusive distance irregularity strength for the join product of graphs. Electronic Journal of Graph Theory and Applications, 10(1):1–13, 2022. 10.5614/ejgta.2022.10.1.1.

B. Utami, K. Sugeng, and S. Utama. On inclusive d-distance irregularity strength on triangular ladder graph and path. AKCE International Journal of Graphs and Combinatorics, 17(3):810–819, 2020. 10.1016/j.akcej.2019.10.003.

R. Wulandari and R. Simanjuntak. Distance antimagic labelings of product graphs. Electronic Journal of Graph Theory and Applications, 11(1):111–123, 2023. 10.5614/ejgta.2023.11.1.9.

[1] A. Ahmad, O. Al-Mushayt, and M. Bača. On edge irregularity strength of graphs. Applied Mathematics and Computation, 243:607–610, 2014. 10.1016/j.amc.2014.06.028.

[2] M. Bača, M. Imran, and A. Semaničová-Feňovčíková. Irregularity and modular irregularity strength of wheels. Mathematics, 9(21):2710, 2021. 10.3390/math9212710.

[3] M. Bača, Z. Kimáková, M. Lascsáková, and A. Semaničová-Feňovčíková. The irregularity and modular irregularity strength of fan graphs. Symmetry, 13(4):605, 2021. 10.3390/sym13040605.

[4] M. Bača, A. Semaničová-Feňovčíková, Slamin, and K. Sugeng. On inclusive distance vertex irregular labelings. Electronic Journal of Graph Theory and Applications, 6(1):61–83, 2018. 10.5614/ejgta.2018.6.1.5.

[5] N. Bong, Y. Lin, and Slamin. On distance-irregular labelings of cycles and wheels. The Australasian Journal of Combinatorics, 69(3):315–322, 2017.

[6] N. Bong, Y. Lin, and Slamin. On inclusive and non-inclusive vertex irregular d-distance vertex labeling. Journal of Combinatorial Mathematics and Combinatorial Computing, 113:233–247, 2020.

[7] G. Chartrand, M. Jacobson, J. Lehel, O. Oellermann, S. Ruiz, and F. Saba. Irregular networks. Congressus Numerantium, 64:197–210, 1988.

[8] G. Chartrand, L. Lesniak, and P. Zhang. Graphs & digraphs, sixth ed. Taylor & Francis Group, Boca Raton, 2016.

[9] N. Cutinho, S. Sudha, and S. Arumugam. Distance antimagic labelings of Cartesian product of graphs. AKCE International Journal of Graphs and Combinatorics, 17(3):940–942, 2020. 10.1016/j.akcej.2019.08.005.

[10] R. Faudree, R. Schelp, M. Jacobson, and J. Lehel. Irregular networks, regular graphs and integer matrices with distinct row and column sums. Discrete Mathematics, 76(3):223–240, 1989. 10.1016/0012-365X(89)90321-X.

[11] J. Gallian. A dynamic survey of graph labeling. The Electronic Journal of Combinatorics:#DS6, 2023. 10.37236/27.

[12] A. Handa, A. Godinho, and T. Singh. Distance antimagic labeling of the ladder graph. Electronic Notes in Discrete Mathematics, 63:317–322, 2017. 10.1016/j.endm.2017.11.028.

[13] A. Handa, A. Godinho, T. Singh, and S. Arumugam. Distance antimagic labeling of join and corona of two graphs. AKCE International Journal of Graphs and Combinatorics, 14(2):172–177, 2017. 10.1016/j.akcej.2017.04.003.

[14] N. Kamatchi and S. Arumugam. Distance antimagic graphs. Journal of Combinatorial Mathematics and Combinatorial Computing, 84:61–67, 2013.

[15] J. Przybyło. The irregularity strength of dense graphs-on asymptotically optimal solutions of problems of Faudree, Jacobson, Kinch, and Lehel. European Journal of Combinatorics, 104013, 2024. 10.1016/j.ejc.2024.104013.

[16] R. Simanjuntak, T. Nadeak, F. Yasin, K. Wijaya, N. Hinding, and K. Sugeng. Another antimagic conjecture. Symmetry, 13(11):2071, 2021. 10.3390/sym13112071.

[17] R. Simanjuntak and A. Tritama. Distance antimagic product graphs. Symmetry, 14(7):1411, 2022. 10.3390/sym14071411.

[18] Slamin. On distance irregular labelling of graphs. Far East Journal of Mathematical Sciences, 102(5):919–932, 2017. 10.17654/ms102050919.

[19] F. Susanto, C. Betitsiyan, I. Halikin, and K. Wijaya. On inclusive distance vertex irregularity strength of small identical copies of star graphs. Journal of Physics: Conference Series, 1872(1):012005, 2021. 10.1088/1742-6596/1872/1/012005.

[20] F. Susanto, K. Wijaya, P. Purnama, and Slamin. On distance irregular labeling of disconnected graphs. Kragujevac Journal of Mathematics, 46(4):507–523, 2022.

[21] F. Susanto, K. Wijaya, Slamin, and A. Semaničová-Feňovčíková. Distance irregularity strength of graphs with pendant vertices. Opuscula Mathematica, 42(3):439–458, 2022. 10.7494/OpMathematics.2022.42.3.439.

[22] F. Susanto, K. Wijaya, I. Sudarsana, and Slamin. Non-inclusive and inclusive distance irregularity strength for the join product of graphs. Electronic Journal of Graph Theory and Applications, 10(1):1–13, 2022. 10.5614/ejgta.2022.10.1.1.

[23] B. Utami, K. Sugeng, and S. Utama. On inclusive d-distance irregularity strength on triangular ladder graph and path. AKCE International Journal of Graphs and Combinatorics, 17(3):810–819, 2020. 10.1016/j.akcej.2019.10.003.

[24] R. Wulandari and R. Simanjuntak. Distance antimagic labelings of product graphs. Electronic Journal of Graph Theory and Applications, 11(1):111–123, 2023. 10.5614/ejgta.2023.11.1.9.

Contents

Utilitas Mathematica

$D$ -irregularity strength of a graph

Abstract

1. Introduction

2. Basic properties

3. Graphs with small diameter

4. Graphs with small maximum degree

5. Final remarks

Acknowledgements

References:

Information

Guidelines

CP Initiatives

Follow CP

Contents

Utilitas Mathematica

D-irregularity strength of a graph

Abstract

1. Introduction

2. Basic properties

3. Graphs with small diameter

4. Graphs with small maximum degree

5. Final remarks

Acknowledgements

References:

Information

Guidelines

CP Initiatives

Follow CP

$D$ -irregularity strength of a graph