A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
Vertex graceful labeling of some classes of graphs

2018
*
Proyecciones
*

A connected graph G = (V, E) of order atleast two, with order p and size q is called vertex-graceful if there exists a bijection f : V → {1, 2, 3, · · · p} such that the induced function f * : is a bijection. The bijection f is called a vertex-graceful labeling of G. A subset S of the set of natural numbers N is called consecutive if S consists of consecutive integers. For any set X, a mapping f : X → N is said to be consecutive if f (X) is consecutive. A vertex-graceful labeling f is said to

doi:10.4067/s0716-09172018000100019
fatcat:hhh3aow6vbak3iojgthvvzgiay