Graceful and edge-antimagic labelings

Martin Bača, Christian Barrientos

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

15 Citas (Scopus)

Resumen

A graph labeling is an assignment of integers (labels) to the vertices and/or edges of a graph. Within vertex labelings, two main branches can be distinguish: difference vertex labelings that associate each edge of the graph with the difference of the labels of its endpoints. Graceful and edge-antimagic vertex labelings correspond to these branches, respectively. In this paper we study some connections between them. Indeed, we study the conditions that allow us to transform any α-labeling (an special case of graceful labeling) of a tree into an (a, 1)- and (a, 2)-edge antimagic vertex labeling.

Idioma originalInglés
Páginas (desde-hasta)505-513
Número de páginas9
PublicaciónArs Combinatoria
Volumen96
EstadoPublicada - jul. 2010
Publicado de forma externa

Huella

Profundice en los temas de investigación de 'Graceful and edge-antimagic labelings'. En conjunto forman una huella única.

Citar esto