# On Total Vertex Irregularity Strength of Hexagonal Cluster Graphs
> Hinding N.

URL kanonis: https://discover.unhas.ac.id/publications/pub_scopus_85100256298
Jurnal / Konferensi: International Journal of Mathematics and Mathematical Sciences
Tahun terbit: 2021
DOI: https://doi.org/10.1155/2021/2743858
ISSN: 01611712
Kuartil SJR: Q3
Citations: 5

## Authors
- Hinding N.

## Abstract
For a simple graph G with a vertex set V(G) and an edge set E(G), a labeling f : V(G)∪​E(G)⟶{1,2, ⋯, k} is called a vertex irregular total k − labeling of G if for any two different vertices x and y in V(G) we have wt(x) ≠ wt(y) where wt(x) = f(x) + ∑u∈V(G)f(xu). The smallest positive integer k such that G has a vertex irregular total k − labeling is called the total vertex irregularity strength of G, denoted by tvs(G). The lower bound of tvs(G) for any graph G have been found by Baca et. al. In this paper, we determined the exact value of the total vertex irregularity strength of the hexagonal cluster graph on n cluster for n ≥ 2. Moreover, we show that the total vertex irregularity strength of the hexagonal cluster graph on n cluster is (3n2 + 1)/2.

## Keywords
- Mathematics
- Combinatorics
- Vertex (graph theory)
- Graph

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