1. Introduction
Wilson (see [
11]) defines a graph
as
, where
represents a finite set of nonempty vertices and
is a finite set of unordered pairs of distinct elements from
, known as edges.
Wallis in [
10] describes a labeling on
as a function whose domain is either
,
, or
, and its codomain is a set of positive or nonnegative integers. When the domain is
, it is called vertex labeling; when it is
, it is edge labeling; and when it is
, it is total labeling. Various labeling techniques can be employed, one of which is irregular labeling with the domain
mapping to a set of positive integers. This labeling is discussed in this paper.
Gallian in [
4] states that there are about 200 types of labeling techniques, evolving in approximately 3000 papers. These techniques include irregular labeling, introduced by Chartrand et al. (see [
3]). In irregular labeling, the weight of a vertex
relative to a total labeling is defined as the sum of the label of
v and all labels of edges incident to
v. From some types of irregular labeling on a graph
, the concepts of total edge irregularity strength (
) and total vertex irregularity strength (
) arise.
Ashraf et al. (see [
2]) introduced the strength of irregularity-
H, an extension of
and
. A graph
with an
H-covering means that for any edge of
, there exists a subgraph of
isomorphic to
H that includes the edge. Let
be any total
p-labeling on
. For any subgraph
K of
isomorphic to
H, the
H-weight of
K with respect to
, denoted by
, is defined as
. A total
p-labeling on
is called
H-irregular if
for every two distinct subgraphs
and
isomorphic to
H. The smallest integer
p such that
can be labeled with an
H-irregular total
p-labeling is called the total
H-irregularity strength of
, denoted by
.
Recently,
has been extensively studied. Agustin et al. in [
1] obtained results on
for shackles and amalgamation graphs. Nisviasari et al. in [
7] researched
for triangular ladder and grid graphs. Hidayatul et al. (see [
5]) obtained results on
for grid, butterfly, hexagonal, and diamond graphs. Suni et al. in [
9] investigated diamond ladder, circular triple ladder, and prism graphs. Wahyujati et al. (see [
12]) studied the total
H-irregularity strength of edge comb product graphs. Shulhany et al. (see [
8]) examined the same parameter for some classes of graphs, while Labane et al. (see [
6]) have done so for cycles and diamond graphs. In this work, we introduce a new type of graph that has not been previously studied by other researchers, which involves applying specific graph operations. These results not only provide fresh insights but also extend the applicability of
to a broader spectrum of graph types. The use of graph operations in the investigation further highlights the structural complexity and versatility of the studied graphs. This finding will significantly enrich the theory of
by deepening our understanding of its behavior in diverse graph classes and paving the way for future studies in this area.
Theorem 1.
[2]. Let ϱ be a graph admitting an covering and have w subgraphs isomorphic to H. Then
2. Main Results
Our research findings will be presented in this section. First, we begin with the following definition.
Definition 1.
The balloon graph , , is a graph with
The following is provided as an example of balloon graph.
Figure 1.
Balloon Graph
Figure 1.
Balloon Graph
Theorem 2.
Given with covering. Then, for ,
Proof. The balloon
,
admits
covering with exactly
balloons
,
and
is a positive integer. From Theorem 1, it holds
Next, put
,
will be proven. On balloon graph
with
covering,
, we define
for
, in this manner:
for
,
for
,
The largest label is reached when , that is,
For every
, the vertex set is
and edge set is
Furthermore, for every subgraph
in
the weight of
, with respect to
is
Then, for
,
For every we get . Hence, . Moreover, all weights are distinct. Therefore, is total irregular labeling of .
Since
and
, we have
, which can be expressed as
□
The following on
Figure 2 is an example of
with
covering and we have
Now, by double balloon graph, we mean the graph defined in Definition 2 as follows.
Definition 2.
A double ballon graph , , is a graph with
The following figure is provided as an example of double balloon graph.
Figure 3.
Double Balloon Graph
Figure 3.
Double Balloon Graph
Theorem 3.
Given with covering. Then, for ,
Proof. The double balloon graph,
,
admits
covering with exactly
double balloon
,
and
is a positive integer. From Theorem 1, we obtain
Next, put
,
will be proven. On double balloon graph
with
covering,
, we define
for
, as follows:
for
,
for
,
The largest label is reached when , that is
For every
, the vertex set is
and the edge set is
Furthermore, for every subgraph
in
, the weight of
, with respect to
is
Then, for
, we have
For every we get . Hence, . Furthermore, all weights are distinct. Thus, is total irregular labeling of .
Since
and
, we have
which can be expressed as
□
Figure 4 is given as an example of
with
covering, and with
Subsequently, Definition 3 furnishes the definition of a double balloon ladder graph.
Definition 3.
A double balloon ladder graph , , is a graph with
The following is provided as an example of double balloon ladder graph.
Figure 5.
Double Balloon Ladder Graph
Figure 5.
Double Balloon Ladder Graph
Theorem 4.
Given with covering. Then, for ,
Proof. The balloon
,
admits
covering with exactly
double balloon ladder
,
and
is a positive integer. By Theorem 1,
Next, put
,
will be proven. On double balloon ladder
with
covering,
, we define
for
, in this way:
for
,
for
,
The largest label is obtained when , that is
For every
, the vertex set is
and the edge set
Furthermore, for every subgraph
in
we have weight
, with respect to
is
Then, for
, we have
For every we get . Hence, . Furthermore, all weights are distinct. Thus, is total irregular labeling of .
Since
and
we have
which can be expressed as
□
The following on
Figure 6 is an example of
with
covering, and we get