Vertex graceful labeling of some classes of graphs

Abstract

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 →