On edge irregularity strength of graphs

Ali Ahmad, Omar Bin Saeed Al-Mushayt, Martin Bača

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

63 Citas (Scopus)

Resumen

For a simple graph G, a vertex labeling :V(G)→{1,2,...,k} is called k-labeling. The weight of an edge xy in G, denoted by w(xy), is the sum of the labels of end vertices x and y, i.e. w(xy)=(x)+(y). A vertex k-labeling is defined to be an edge irregular k-labeling of the graph G if for every two different edges e and f there is w(e)≠w(f). The minimum k for which the graph G has an edge irregular k-labeling is called the edge irregularity strength of G, denoted by es(G). In this paper, we estimate the bounds of the edge irregularity strength and determine the exact value for several families of graphs.

Idioma originalInglés
Páginas (desde-hasta)607-610
Número de páginas4
PublicaciónApplied Mathematics and Computation
Volumen243
DOI
EstadoPublicada - 15 sep. 2014
Publicado de forma externa

Huella

Profundice en los temas de investigación de 'On edge irregularity strength of graphs'. En conjunto forman una huella única.

Citar esto