Graceful Labelings of Graphs Associated with Vertex-Saturated Graphs

Abstract

A graceful graph with \(n\) edges and \(n+1\) vertices is called a vertex-saturated graph. Each graceful graph corresponds to a vertex-saturated graph. Four classes of graceful graphs associated with vertex-saturated graphs are presented. Three of which generalize the results of [1], [2] and [5].