Total Irregularity Strength of Three Families of Graphs

Abstract:

We deal with the totally irregular total labeling which is required to be at the same time vertex irregular total and also edge irregular total. The minimum k for which a graph G has a totally irregular total k-labeling is called the total irregularity strength of G. In this paper, we estimate the upper bound of the total irregularity strength of graphs and determine the exact value of the total irregularity strength for three families of graphs.

Año de publicación:

2015

Keywords:

• Totally irregular total labeling
• Vertex irregular total labeling
• Edge irregular total labeling

Fuente:

scopus