Preprint
Article

This version is not peer-reviewed.

On Constructing H-Irregularity Labeling with Minimum Label for Certain Balloon Graphs

Submitted:

15 May 2025

Posted:

15 May 2025

You are already at the latest version

Abstract
If ϱ and H are simple, connected, undirected graphs, and ϱ can be covered by an H-covering, then for a positive integer p, a total p-labeling φ on ϱ is considered as a total H-irregular p-labeling if, for every subgraph K of ϱ that is isomorphic to H, the weight of K (the sum of the labels of all vertices and edges of K) is a unique number. The smallest integer p for which graph ϱ can be labeled with a total H-irregular p-labeling is called the total H-irregularity strength of graph G. This paper presents the exact total H-irregularity strength values for some particular graphs including balloon graphs, double balloon graphs, and double balloon ladder graphs.
Keywords: 
;  ;  ;  

1. Introduction

Wilson (see [11]) defines a graph ϱ as ( V ( ϱ ) , E ( ϱ ) ) , where V ( ϱ ) represents a finite set of nonempty vertices and E ( ϱ ) is a finite set of unordered pairs of distinct elements from V ( ϱ ) , known as edges.
Wallis in [10] describes a labeling on ϱ as a function whose domain is either V ( ϱ ) , E ( ϱ ) , or V ( ϱ ) E ( ϱ ) , and its codomain is a set of positive or nonnegative integers. When the domain is V ( ϱ ) , it is called vertex labeling; when it is E ( ϱ ) , it is edge labeling; and when it is V ( ϱ ) E ( ϱ ) , it is total labeling. Various labeling techniques can be employed, one of which is irregular labeling with the domain V ( ϱ ) E ( ϱ ) 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 v V ( ϱ ) 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 ( t e s ) and total vertex irregularity strength ( t v s ) arise.
Ashraf et al. (see [2]) introduced the strength of irregularity-H, an extension of t e s and t v s . 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 φ : V ( ϱ ) E ( ϱ ) { 1 , 2 , , p } be any total p-labeling on ϱ . For any subgraph K of ϱ isomorphic to H, the H-weight of K with respect to φ , denoted by w t φ ( K ) , is defined as w t φ ( K ) = v V ( K ) φ ( v ) + e E ( K ) φ ( e ) . A total p-labeling on ϱ is called H-irregular if w t φ ( K ) w t φ ( K ) for every two distinct subgraphs K and K 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 t H s ( ϱ , H ) .
Recently, t H s ( ϱ , H ) has been extensively studied. Agustin et al. in [1] obtained results on t H s ( ϱ , H ) for shackles and amalgamation graphs. Nisviasari et al. in [7] researched t H s ( ϱ , H ) for triangular ladder and grid graphs. Hidayatul et al. (see [5]) obtained results on t H s ( ϱ , H ) 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 t H s ( ϱ , H ) 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 t H s ( ϱ , H ) 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 H covering and have w subgraphs isomorphic to H. Then
t H s ( ϱ , H ) 1 + w 1 | V ( H ) | + | E ( H ) | .

2. Main Results

Our research findings will be presented in this section. First, we begin with the following definition.
Definition 1. 
The balloon graph B l η , η 1 , is a graph with
V ( B l η ) = { x q , y q : q = 1 , 2 , , η } { z q : q = 1 , 2 , , η + 1 }
and
E ( B l η ) = { x q y q , y q z q , y q z q + 1 , z q z q + 1 : q = 1 , 2 , , η } .
The following is provided as an example of balloon graph.
Figure 1. Balloon Graph B l 5
Figure 1. Balloon Graph B l 5
Preprints 159624 g001
Theorem 2. 
Given B l η , η 1 with B l ζ covering. Then, for 1 ζ η ,
t H s ( B l η , B l ζ ) = 6 ζ + η + 1 7 ζ + 1 .
Proof. The balloon B l η , η 1 admits B l ζ covering with exactly η ζ + 1 balloons B l ζ , 1 ζ η and η is a positive integer. From Theorem 1, it holds
t H s ( B l η , B l ζ ) 1 + ( η ζ + 1 ) 1 7 ζ + 1 = 6 ζ + η + 1 7 ζ + 1 .
Next, put p = 6 ζ + η + 1 7 ζ + 1 , t H s ( B l η , B l ζ ) p will be proven. On balloon graph B l η with B l ζ covering, 1 ζ η , we define
Ψ η , ζ : V ( B l η ) E ( B l η ) { 1 , 2 , , p } ,
for ζ = 1 , 2 , , η , in this manner:
for q = 1 , 2 , , η ,
Ψ η , ζ ( x q ) = q 7 ζ + 1 , Ψ η , ζ ( y q ) = q + 2 ζ 7 ζ + 1 , Ψ η , ζ ( x q y q ) = q + ζ 7 ζ + 1 ,
Ψ η , ζ ( y q z q ) = q + 3 ζ 7 ζ + 1 , Ψ η , ζ ( y q z q + 1 ) = q + 4 ζ 7 ζ + 1 , Ψ η , ζ ( z q z q + 1 ) = q + 5 ζ 7 ζ + 1 .
for q = 1 , 2 , , η + 1 ,
Ψ η , ζ ( z q ) = q + 6 ζ 7 ζ + 1 .
The largest label is reached when q = η + 1 , that is, Ψ η , ζ ( z q ) = 6 ζ + η + 1 7 ζ + 1 .
For every r = 1 , 2 , 3 , , η ζ + 1 , the vertex set is
V ( B l ζ ) = { x r + q , y r + q : q = 0 , 1 , 2 , , ζ 1 } { z r + q : q = 0 , 1 , 2 , , ζ }
and edge set is
E ( B l ζ ) = { x r + q y r + q , y r + q z r + q , y r + q z r + q + 1 , z r + q z r + q + 1 : q = 0 , 1 , 2 , , ζ 1 } .
Furthermore, for every subgraph B l ζ r in B l ζ the weight of B l ζ r , r = 1 , 2 , , η ζ + 1 , with respect to Ψ η , ζ : V ( B l ζ ) E ( B l ζ ) { 1 , 2 , , p } is
w t Ψ η , ζ ( B l ζ r ) = v V ( B l ζ r ) Ψ η , ζ ( v ) + e E ( B l ζ r ) Ψ η , ζ ( e ) .
Then, for r = 1 , 2 , , η ζ ,
w t Ψ η , ζ B l ζ r + 1 w t Ψ η , ζ B l ζ r = Ψ η , ζ ( x r + ζ ) + Ψ η , ζ ( y r + ζ ) + Ψ η , ζ ( z r + ζ + 1 ) + Ψ η , ζ ( x r + ζ y r + ζ ) + Ψ η , ζ ( y r + ζ z r + ζ ) + Ψ η , ζ ( y r + ζ z r + ζ + 1 ) + Ψ η , ζ ( z r + ζ z r + ζ + 1 ) Ψ η , ζ ( x r ) Ψ η , ζ ( y r ) Ψ η , ζ ( z r ) Ψ η , ζ ( x r y r ) Ψ η , ζ ( y r z r ) Ψ η , ζ ( y r z r + 1 ) Ψ η , ζ ( z r z r + 1 ) = r + ζ 7 ζ + 1 + r + 3 ζ 7 ζ + 1 + r + 7 ζ + 1 7 ζ + 1 + r + 2 ζ 7 ζ + 1 + r + 4 ζ 7 ζ + 1 + r + 5 ζ 7 ζ + 1 + r + 6 ζ 7 ζ + 1 r 7 ζ + 1 r + 2 ζ 7 ζ + 1 r + 6 ζ 7 ζ + 1 r + ζ 7 ζ + 1 r + 3 ζ 7 ζ + 1 r + 4 ζ 7 ζ + 1 r + 5 ζ 7 ζ + 1 = 1 .
For every r = 1 , 2 , , η ζ we get w t Ψ η , ζ ( B l ζ r ) < w t Ψ η , ζ ( B l ζ r + 1 ) . Hence, w t Ψ η , ζ ( B l ζ r + 1 ) = 1 + w t Ψ η , ζ ( B l ζ r ) . Moreover, all D B L ζ weights are distinct. Therefore, Ψ η , ζ is total B l ζ irregular labeling of B l η .
Since t H s ( B l η , B l ζ ) p and t H s ( B l η , B l ζ ) p , we have t H s ( B l η , B l ζ ) = p , which can be expressed as
t H s ( B l η , B l ζ ) = 6 ζ + η + 1 7 ζ + 1 .
The following on Figure 2 is an example of B l 10 with B l 3 covering and we have t H s ( B l 10 , B l 3 ) = 2 .
Now, by double balloon graph, we mean the graph defined in Definition 2 as follows.
Definition 2. 
A double ballon graph D B l η , η 1 , is a graph with
V ( D B l η ) = { x q , y q : q = 1 , 2 , , η } { w q , z q : q = 1 , 2 , , η + 1 }
and
E ( D B l η ) = { w q w q + 1 , x q w q , x q w q + 1 , x q y q , y q z q , y q z q + 1 , z q z q + 1 : q = 1 , 2 , , η } .
The following figure is provided as an example of double balloon graph.
Figure 3. Double Balloon Graph D B l 5
Figure 3. Double Balloon Graph D B l 5
Preprints 159624 g003
Theorem 3. 
Given D B l η , η 1 with D B l ζ covering. Then, for 1 ζ η ,
t H s ( D B l η , D B l ζ ) = 10 ζ + η + 2 11 ζ + 2 .
Proof. The double balloon graph, D B l η , η 1 admits D B l ζ covering with exactly η ζ + 1 double balloon D B l ζ , 1 ζ η and η is a positive integer. From Theorem 1, we obtain
t H s ( D B l η , D B l ζ ) 1 + ( η ζ + 1 ) 1 11 ζ + 2 = 10 ζ + η + 2 11 ζ + 2 .
Next, put p = 10 ζ + η + 2 11 ζ + 2 , t H s ( D B l η , D B l ζ ) p will be proven. On double balloon graph D B l η with D B l ζ covering, 1 ζ η , we define
Ψ η , ζ : V ( D B l η ) E ( D B l η ) { 1 , 2 , , p } ,
for ζ = 1 , 2 , , η , as follows:
for q = 1 , 2 , , η ,
Ψ η , ζ ( x q ) = q + 7 ζ 11 ζ + 2 , Ψ η , ζ ( y q ) = q + 4 ζ 11 ζ + 2 , Ψ η , ζ ( x q y q ) = q + 5 ζ 11 ζ + 2 ,
Ψ η , ζ ( y q z q ) = q + 2 ζ 11 ζ + 2 , Ψ η , ζ ( y q z q + 1 ) = q + 3 ζ 11 ζ + 2 ,
Ψ η , ζ ( z q z q + 1 ) = q 11 ζ + 2 , Ψ η , ζ ( w q w q + 1 ) = q + ζ 11 ζ + 2 ,
Ψ η , ζ ( x q w q ) = q + 6 ζ 11 ζ + 2 , Ψ η , ζ ( x q w q + 1 ) = q + 8 ζ 11 ζ + 2 .
for q = 1 , 2 , , η + 1 ,
Ψ η , ζ ( w q ) = q + 10 ζ + 1 11 ζ + 2 , Ψ η , ζ ( z q ) = q + 9 ζ 11 ζ + 2 .
The largest label is reached when q = η + 1 , that is Ψ η , ζ ( w q ) = 10 ζ + η + 2 11 ζ + 2 .
For every r = 1 , 2 , 3 , , η ζ + 1 , the vertex set is
V ( D B l ζ ) = { x r + q , y r + q : q = 0 , 1 , 2 , , ζ 1 } { w r + q , z r + q : q = 0 , 1 , 2 , , ζ }
and the edge set is
E ( D B l ζ ) = { w r + q w r + q + 1 , x r + q w r + q , x r + q w r + q + 1 , x r + q y r + q , y r + q z r + q , y r + q z r + q + 1 , z r + q z r + q + 1 : q = 0 , 1 , 2 , , ζ 1 } .
Furthermore, for every subgraph D B l ζ r in D B l ζ , the weight of D B l ζ r , r = 1 , 2 , , η ζ + 1 , with respect to Ψ η , ζ : V ( D B l ζ ) E ( D B l ζ ) { 1 , 2 , , p } is
w t Ψ η , ζ ( D B l ζ r ) = v V ( D B l ζ r ) Ψ η , ζ ( v ) + e E ( D B l ζ r ) Ψ η , ζ ( e ) .
Then, for r = 1 , 2 , , η ζ , we have
w t Ψ η , ζ D B l ζ r + 1 w t Ψ η , ζ D B l ζ r = Ψ η , ζ ( w r + ζ + 1 ) + Ψ η , ζ ( w r + ζ w r + ζ + 1 ) + Ψ η , ζ ( x r + ζ w r + ζ ) + Ψ η , ζ ( x r + ζ w r + ζ + 1 ) + Ψ η , ζ ( x r + ζ ) + Ψ η , ζ ( y r + ζ ) + Ψ η , ζ ( z r + ζ + 1 ) + Ψ η , ζ ( x r + ζ y r + ζ ) + Ψ η , ζ ( y r + ζ z r + ζ ) + Ψ η , ζ ( y r + ζ z r + ζ + 1 ) + Ψ η , ζ ( z r + ζ z r + ζ + 1 ) Ψ η , ζ ( x r ) Ψ η , ζ ( y r ) Ψ η , ζ ( z r ) Ψ η , ζ ( w r ) Ψ η , ζ ( w r w r + 1 ) Ψ η , ζ ( x r w r ) Ψ η , ζ ( x r w r + 1 ) Ψ η , ζ ( x r y r ) Ψ η , ζ ( y r z r ) Ψ η , ζ ( y r z r + 1 ) Ψ η , ζ ( z r z r + 1 ) = r + 11 ζ + 2 11 ζ + 2 + r + 2 ζ 11 ζ + 2 + r + 7 ζ 11 ζ + 2 + r + 9 ζ 11 ζ + 2 + r + 8 ζ 11 ζ + 2 + r + 5 ζ 11 ζ + 2 + r + 10 ζ + 1 11 ζ + 2 + r + 6 ζ 11 ζ + 2 + r + 3 ζ 11 ζ + 2 + r + 4 ζ 11 ζ + 2 + r + ζ 11 ζ + 2 r + 7 ζ 11 ζ + 2 r + 4 ζ 11 ζ + 2 r + 9 ζ 11 ζ + 2 r + 10 ζ + 1 11 ζ + 2 r + ζ 11 ζ + 2 r + 6 ζ 11 ζ + 2 r + 8 ζ 11 ζ + 2 r + 5 ζ 11 ζ + 2 r + 2 ζ 11 ζ + 2 r + 3 ζ 11 ζ + 2 r 11 ζ + 2 = 1 .
For every r = 1 , 2 , , η ζ we get w t Ψ η , ζ ( D B l ζ r ) < w t Ψ η , ζ ( D B l ζ r + 1 ) . Hence, w t Ψ η , ζ ( D B l ζ r + 1 ) = 1 + w t Ψ η , ζ ( D B l ζ r ) . Furthermore, all D B L ζ weights are distinct. Thus, Ψ η , ζ is total D B l ζ irregular labeling of D B l η .
Since t H s ( D B l η , D B l ζ ) p and t H s ( D B l η , D B l ζ ) p , we have
t H s ( D B l η , D B l ζ ) = p ,
which can be expressed as
t H s ( D B l η , D B l ζ ) = 10 ζ + η + 2 11 ζ + 2 .
Figure 4 is given as an example of D B l 19 with D B l 2 covering, and with t H s ( D B l 19 , D B l 2 ) = 2 .
Subsequently, Definition 3 furnishes the definition of a double balloon ladder graph.
Definition 3. 
A double balloon ladder graph D B l L η , η 1 , is a graph with
V ( D B l L η ) = { x q , y q : q = 1 , 2 , , η } { w q , z q : q = 1 , 2 , , η + 1 }
and
E ( D B l L η ) = { w q w q + 1 , x q w q , x q w q + 1 , x q y q , y q z q , y q z q + 1 , z q z q + 1 : q = 1 , 2 , , η }
{ w q z q : q = 1 , 2 , , η + 1 } .
The following is provided as an example of double balloon ladder graph.
Figure 5. Double Balloon Ladder Graph D B l L 5
Figure 5. Double Balloon Ladder Graph D B l L 5
Preprints 159624 g005
Theorem 4. 
Given D B l L η , η 1 with D B l ζ covering. Then, for 1 ζ η ,
t H s ( D B l L η , D B l L ζ ) = 11 ζ + η + 3 12 ζ + 3 .
Proof. 
The balloon D B l L η , η 1 admits D B l L ζ covering with exactly η ζ + 1 double balloon ladder D B l L ζ , 1 ζ η and η is a positive integer. By Theorem 1,
t H s ( D B l L η , D B l L ζ ) 1 + ( η ζ + 1 ) 1 12 ζ + 3 = 11 ζ + η + 3 12 ζ + 3 .
Next, put p = 11 ζ + η + 3 12 ζ + 3 , t H s ( D B l L η , D B l L ζ ) p will be proven. On double balloon ladder D B l L η with D B l L ζ covering, 1 ζ η , we define
Ψ η , ζ : V ( D B l L η ) E ( D B l L η ) { 1 , 2 , , p } ,
for ζ = 1 , 2 , , η , in this way:
for q = 1 , 2 , , η ,
Ψ η , ζ ( x q ) = q + 6 ζ 12 ζ + 3 , Ψ η , ζ ( y q ) = q + 3 ζ 12 ζ + 3 , Ψ η , ζ ( x q y q ) = q + 4 ζ 12 ζ + 3 ,
Ψ η , ζ ( y q z q ) = q + ζ 11 ζ + 3 , Ψ η , ζ ( y q z q + 1 ) = q + 2 ζ 12 ζ + 3 ,
Ψ η , ζ ( z q z q + 1 ) = q 12 ζ + 3 , Ψ η , ζ ( w q w q + 1 ) = q 12 ζ + 3 ,
Ψ η , ζ ( x q w q ) = q + 5 ζ 12 ζ + 3 , Ψ η , ζ ( x q w q + 1 ) = q + 7 ζ 12 ζ + 3 .
for q = 1 , 2 , , η + 1 ,
Ψ η , ζ ( w q ) = q + 11 ζ + 2 12 ζ + 3 , Ψ η , ζ ( z q ) = q + 9 ζ 12 ζ + 3 ,
Ψ η , ζ ( w q z q ) = q + 10 ζ + 1 12 ζ + 3 .
The largest label is obtained when q = η + 1 , that is Ψ η , ζ ( w q ) = 11 ζ + η + 3 12 ζ + 3 .
For every r = 1 , 2 , 3 , , η ζ + 1 , the vertex set is
V ( D B l L ζ ) = { x r + q , y r + q : q = 0 , 1 , 2 , , ζ 1 } { w r + q , z r + q : q = 0 , 1 , 2 , , ζ }
and the edge set
E ( D B l L ζ ) = { w r + q w r + q + 1 , x r + q w r + q , x r + q w r + q + 1 , x r + q y r + q , y r + q z r + q , y r + q z r + q + 1 , z r + q z r + q + 1 , w q z q : q = 0 , 1 , 2 , , ζ 1 } .
Furthermore, for every subgraph D B l L ζ r in D B l ζ we have weight D B l L ζ r , r = 1 , 2 , , η ζ + 1 , with respect to Ψ η , ζ : V ( D B l L ζ ) E ( D B l L ζ ) { 1 , 2 , , p } is
w t Ψ η , ζ ( D B l ζ r ) = v V ( D B l L ζ r ) Ψ η , ζ ( v ) + e E ( D B l L ζ r ) Ψ η , ζ ( e ) .
Then, for r = 1 , 2 , , η ζ , we have
w t Ψ η , ζ D B l ζ r + 1 w t Ψ η , ζ D B l ζ r = Ψ η , ζ ( w r + ζ + 1 ) + Ψ η , ζ ( w r + ζ w r + ζ + 1 ) + Ψ η , ζ ( x r + ζ w r + ζ ) + Ψ η , ζ ( x r + ζ w r + ζ + 1 ) + Ψ η , ζ ( x r + ζ ) + Ψ η , ζ ( y r + ζ ) + Ψ η , ζ ( z r + ζ + 1 ) + Ψ η , ζ ( x r + ζ y r + ζ ) + Ψ η , ζ ( y r + ζ z r + ζ ) + Ψ η , ζ ( y r + ζ z r + ζ + 1 ) + Ψ η , ζ ( z r + ζ z r + ζ + 1 ) + Ψ η , ζ ( w r + ζ + 1 z r + ζ + 1 ) Ψ η , ζ ( x r ) Ψ η , ζ ( y r ) Ψ η , ζ ( z r ) Ψ η , ζ ( w r ) Ψ η , ζ ( w r w r + 1 ) Ψ η , ζ ( x r w r ) Ψ η , ζ ( x r w r + 1 ) Ψ η , ζ ( x r y r ) Ψ η , ζ ( y r z r ) Ψ η , ζ ( y r z r + 1 ) Ψ η , ζ ( z r z r + 1 ) Ψ η , ζ ( w r z r )
= r + 12 ζ + 3 12 ζ + 3 + r + 9 ζ 12 ζ + 3 + r + 6 ζ 12 ζ + 3 + r + 8 ζ 12 ζ + 3 + r + 7 ζ 12 ζ + 3 + r + 4 ζ 12 ζ + 3 + r + 10 ζ + 1 12 ζ + 3 + r + 5 ζ 12 ζ + 3 + r + 2 ζ 12 ζ + 3 + r + 3 ζ 12 ζ + 3 + r + ζ 13 ζ + 2 + r + 11 ζ + 2 12 ζ + 3 r + 6 ζ 12 ζ + 3 r + 3 ζ 12 ζ + 3 r + 9 ζ 12 ζ + 3 r + 11 ζ + 2 12 ζ + 3 r + 8 ζ 12 ζ + 3 r + 5 ζ 12 ζ + 3 r + 7 ζ 12 ζ + 3 r + 4 ζ 12 ζ + 3 r + ζ 12 ζ + 3 r + 2 ζ 12 ζ + 3 r 12 ζ + 3 r + 10 ζ + 1 12 ζ + 3 = 1 .
For every r = 1 , 2 , , η ζ we get w t Ψ η , ζ ( D B l L ζ r ) < w t Ψ η , ζ ( D B l L ζ r + 1 ) . Hence, w t Ψ η , ζ ( D B l L ζ r + 1 ) = 1 + w t Ψ η , ζ ( D B l L ζ r ) . Furthermore, all D B L ζ weights are distinct. Thus, Ψ η , ζ is total D B l L ζ irregular labeling of D B l L η .
Since t H s ( D B l L η , D B l L ζ ) p and t H s ( D B l L η , D B l L ζ ) p we have
t H s ( D B l L η , D B l L ζ ) = p ,
which can be expressed as
t H s ( D B l L η , D B l L ζ ) = 11 ζ + η + 3 12 ζ + 3 .
The following on Figure 6 is an example of D B l L 28 with D B l L 2 covering, and we get t H s ( D B l L 28 , D B l L 2 ) = 2 .

3. Concluding Remarks

This research focuses on the total H irregularity strength of balloon graph B l η with B l ζ covering, double balloon graph D B l η , and double balloon ladder graph D B l L η with D B l ζ covering. We found that the lower bound given in Theorem 1 is sharp for all these graphs.

Acknowledgments

All authors gratitude all the reviewers for their valuable thoughtful feedback.

References

  1. Agustin, I. H. , Dafik, D., Marsidi, M., and Albirri, E. R., 2017, On the total H-irregularity strength of graphs: a new notion, Journal of Physics: Conference Series. 855 (1).
  2. Ashraf, F. , Bača, M., Lascśaková, M., Semaničová-Feňovčíková, A., 2017, On H-irregularity strength of graphs, Discussiones Mathematicae Graph Theory, 37(4) 1067-1078.
  3. Chartrand, G. , Jacobson, M. S., Lehel, J., 1988, Irregular networks. Congr. Numer, 64, 187-192.
  4. Gallian, J. A. , 2022, A dynamic survey of graph labeling, Electronic Journal of Combinatorics 1.
  5. Hidayatul, M. , Dafik, D., Agustin, I. H., Nisviasari, R., Kurniawati, E.Y., 2020, On total H-irregularity strength of graphs, Journal of Physics: Conference Series, 1465 (1).
  6. Labane, H. , Bouchemakh, I., and Semaničová-Feňovčíková, A., 2022, On H-irregularity strength of cycles and diamond graphs Discrete Mathematics, Algorithms and Applications 14 (5) 2150157.
  7. Nisviasari, R. , Dafik, D., Agustin, I. H., 2019, The total H-irregularity strength of triangular ladder and grid graphs, Journal of Physics: Conference Series, 1211 (1) 012005.
  8. Shulhany, M. A. , et al., 2022, The total H-irregularity strength of some graph classes, AIP Conference Proceedings, 2468 (1).
  9. Suni, D. M. O. , Dafik, D., Tirta, I. M., Kristiana, A. I., and Nisviasari, R., 2020, On total H-irregularity strength of diamond ladder, three circular ladder, and prism graphs, Journal of Physics: Conference Series, Vol. 1465 (1) 012021.
  10. Wallis, W. D. , 2007, A beginner’s guide to graph theory. Springer Science & Business Media.
  11. Wilson, R. J. , 2010, Introduction to graph theory, Fifth Edition, Pearson.
  12. Wahyujati, M. F. , Susanti, Y., 2022, Computing the total H-irregularity strength of edge comb product of graphs, " Analele ştiinţifice ale Universităţii Ovidius Constanţa. Seria Matematică, 31 (2) 177-189.
Figure 2. Balloon graph B l 10 with B l 3 covering.
Figure 2. Balloon graph B l 10 with B l 3 covering.
Preprints 159624 g002
Figure 4. Double Ballon Graph D B L 19 with D B L 2 covering
Figure 4. Double Ballon Graph D B L 19 with D B L 2 covering
Preprints 159624 g004
Figure 6. Total D B l L Irregularity Labeling of D B l L 28
Figure 6. Total D B l L Irregularity Labeling of D B l L 28
Preprints 159624 g006
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.
Copyright: This open access article is published under a Creative Commons CC BY 4.0 license, which permit the free download, distribution, and reuse, provided that the author and preprint are cited in any reuse.
Prerpints.org logo

Preprints.org is a free preprint server supported by MDPI in Basel, Switzerland.

Subscribe

Disclaimer

Terms of Use

Privacy Policy

Privacy Settings

© 2025 MDPI (Basel, Switzerland) unless otherwise stated