On Total Edge Irregularity Strength of Generalized Web Graphs and Related Graphs

Diari Indriati, Widodo, Indah E. Wijayanti, Kiki Ariyanti, Martin Bača

Research output: Contribution to journalArticlepeer-review

21 Citations (Scopus)

Abstract

Let G = (V, E) be a simple, connected and undirected graph with non empty vertex set V and edge set E. An edge irregular total k-labeling f:V(G)∪E(G)→{1,2,…,k} is a labeling of vertices and edges of G in such a way that for any different edges xy and x′y′ their weights f(x) + f(xy) + f(y) and f(x′) + f(x′y′) + f(y′) are distinct. A total edge irregularity strength of graph G, denoted by tes(G), is defined as the minimum k for which G has an edge irregular total k-labeling. In this paper, we determine the exact value of the total edge irregularity strength of the generalized web graph W(n, m) and two families of related graphs.

Original languageEnglish
Pages (from-to)161-167
Number of pages7
JournalMathematics in Computer Science
Volume9
Issue number2
DOIs
Publication statusPublished - 15 Jun 2015

Keywords

  • Generalized web
  • Irregular total k-labeling
  • Total edge irregularity strength

Fingerprint Dive into the research topics of 'On Total Edge Irregularity Strength of Generalized Web Graphs and Related Graphs'. Together they form a unique fingerprint.

Cite this