The total vertex irregularity strength of generalized helm graphs and prisms with outer pendant edges

Diari Indriati, Widodo, Indah E. Wijayanti, Kiki A. Sugeng, Martin Bača, Andrea Semaničová-Feňovčíková

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

20 Citas (Scopus)

Resumen

For a simple graph G = (V,E) with the vertex set V and the edge set E, a vertex irregular total k-labeling f: V ∪E → {1, 2,…, k} is a labeling of vertices and edges of G in such a way that for any two different vertices x and x′, their weights wtf (x) = f(x) + ∑xy∈E f(xy) and wtf (x′) = f(x′)+ ∑x′y∈E f(x′y′) are distinct. A smallest positive integer k for which G admits a vertex irregular total k-labeling is defined as a total vertex irregularity strength of graph G, denoted by tvs(G). In this paper, we determine the exact value of the total vertex irregularity strength for generalized helm graphs and for prisms with outer pendant edges.

Idioma originalInglés
Páginas (desde-hasta)14-26
Número de páginas13
PublicaciónAustralasian Journal of Combinatorics
Volumen65
N.º1
EstadoPublicada - 2016
Publicado de forma externa

Huella

Profundice en los temas de investigación de 'The total vertex irregularity strength of generalized helm graphs and prisms with outer pendant edges'. En conjunto forman una huella única.

Citar esto