Total edge irregularity strength of a categorical product of two paths

Abstract:

An edge irregular total k-labeling of a graph G = (V, E) is a labeling f: V ∪ E → {1,2,-,k} such that the total edge-weights wt(xy) = f(x) + f(xy) + f(y) are different for all pairs of distinct edges. The minimum k for which the graph G has an edge irregular total k-labeling is called the total edge irregularity strength of G. In this paper, we determine the exact value of the total edge irregularity strength of the categorical product of two paths P n and Pm. Our result adds further support to a recent conjecture of Ivančo and Jendrol.

Año de publicación:

2014

Keywords:

• Irregularity strength
• Edge irregular total labeling
• total edge irregularity strength
• Categorical product

Fuente:

scopus