Graceful Labels Of Some Graphs Joined By An Arbitrary Path

Abstract

We proved the gracefulness of graphs formed by connecting different graphs. And found the result (1) The graph G is obtained by connecting a quadrilateral and a quadrilateral with one chord through a path of arbitrary length is graceful. (2) The graph G obtained through joined a quadrilateral with one chord and a barycentric subdivision of C_n (n ≡ 0,2 (mod 4)) by a path of arbitrary length is graceful. (3)The graph G obtained through joined a quadrilateral with one chord G₁and a quadrilateral snake G₂ by a path of arbitrary length is graceful.