On Total Vertex Irregularity Strength of Hexagonal Cluster Graphs

Nurdin Hinding, Hye Kyung Kim, Nurtiti Sunusi, Riskawati Mise and Sergejs Solovjovs

International Journal of Mathematics and Mathematical Sciences, 2021, vol. 2021, 1-9

Abstract: For a simple graph G with a vertex set VG and an edge set EG, a labeling f:VG∪​EG⟶1,2,⋯,k is called a vertex irregular total k−labeling of G if for any two different vertices x and y in VG we have wtx≠wty where wtx=fx+∑u∈VGfxu. 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 tvsG. The lower bound of tvsG 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.

Date: 2021
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/ijmms/2021/2743858.pdf (application/pdf)
http://downloads.hindawi.com/journals/ijmms/2021/2743858.xml (application/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jijmms:2743858

DOI: 10.1155/2021/2743858

Access Statistics for this article

More articles in International Journal of Mathematics and Mathematical Sciences from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().