On the total edge irregularity strength of gear and related graphs

Diari Indriati, Widodo, Indah E. Wijayanti, Kiki Ariyanti

Research output: Contribution to journalArticlepeer-review

Abstract

A total k-labeling is a function that maps all of vertices and edges of graph G into a set of positive integer labels {1, 2, ..., k}. A total k-labeling of G such that the weights calculated at all edges are distinct, is called an edge irregular total k-labeling. A total edge irregularity strength of G, denoted by tes(G), is a minimum value of the largest label k over all such irregular total k-labelings on G. In this paper, we investigate the total edge irregularity strength of a gear graph Gn and two families of related graphs.

Original languageEnglish
Pages (from-to)117-127
Number of pages11
JournalFar East Journal of Mathematical Sciences
Volume90
Issue number1
Publication statusPublished - 1 Jan 2014

Fingerprint Dive into the research topics of 'On the total edge irregularity strength of gear and related graphs'. Together they form a unique fingerprint.

Cite this