# The Total H-Irregularity Strength of Some Graph Classes
> Shulhany A.

URL kanonis: https://discover.unhas.ac.id/publications/the-total-h-irregularity-strength-of-some-graph-classes
Jurnal / Konferensi: Aip Conference Proceedings
Tahun terbit: 2022
DOI: https://doi.org/10.1063/5.0102491
Citations: 0

## Authors
- Shulhany A.

## Abstract
Let G be an undirected, simple, nontrivial, and finite graphs admitting an H-covering. The total s-labeling a: V(G) ᴜ E(G) ➔ {1,2, …, s} is called a total H-irregular s-labeling of G if for any pair of subgraphs H'≅H and H''≅H, it holds ω(H') ≠ ω(H'') when H' ≠ H''. Define an H-weight, denoted by ω(H), which sum of all edge and vertex labels in subgraph H ⊆ G under the total s-labeling. The smallest positive integer s such that G has an H-irregular total s-labeling is the total H-irregularity strength of G, denoted by ths(G, H). A (n, 1)-tadpole graph is a graph on n+1 vertices and denoted by Tdn. In this paper, we find ths of of some graphs with Tdn-covering, i.e. generalized butterfly graphs, and eclipse graphs.

## Keywords
- Combinatorics
- Mathematics
- Vertex (graph theory)
- Graph
- Undirected graph
- Integer (computer science)
- Discrete mathematics
- Computer science
- Programming language

---
Sumber: Discover Unhas — RIMS Universitas Hasanuddin.
Saat mengutip, gunakan DOI bila tersedia atau URL kanonis di atas.