On vertex irregular total labelings

Ali Ahmad, Martin Bača

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

34 Citas (Scopus)

Resumen

A vertex irregular total labeling σ of a graph G is a labeling of vertices and edges of G with labels from the set {1,2,..., k} in such a way that for any two different vertices x and y their weights wt(x) and wt(y) are distinct. The weight wt(x) of a vertex x in G is the sum of its label and the labels of all edges incident with a given vertex x. The minimum k for which the graph G has a vertex irregular total labeling is called the total vertex irregularity strength of G. In this paper, we study the total vertex irregularity strength for two families of graphs, namely Jahangir graphs and circulant graphs.

Idioma originalInglés
Páginas (desde-hasta)129-139
Número de páginas11
PublicaciónArs Combinatoria
Volumen112
EstadoPublicada - oct. 2013
Publicado de forma externa

Huella

Profundice en los temas de investigación de 'On vertex irregular total labelings'. En conjunto forman una huella única.

Citar esto