Total Irregularity Strength of Three Families of Graphs

Rismawati Ramdani, A. N.M. Salman, Hilda Assiyatun, Andrea Semaničová-Feňovčíková, Martin Bača

Producción científica: Contribución a una revistaArtículorevisión exhaustiva

17 Citas (Scopus)

Resumen

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.

Idioma originalInglés
Páginas (desde-hasta)229-237
Número de páginas9
PublicaciónMathematics in Computer Science
Volumen9
N.º2
DOI
EstadoPublicada - 15 jun. 2015
Publicado de forma externa

Huella

Profundice en los temas de investigación de 'Total Irregularity Strength of Three Families of Graphs'. En conjunto forman una huella única.

Citar esto