Graceful Labeling on Thorny-Snake Graphs

Abstract

Graph labeling is assigning a value to the elements of a graph, usually positive integers. One of the labeling that continues to develop is graceful labeling. A Graceful labeling was first discovered by Rosa in 1967. Since this discovery, many researchers are interested in finding the graceful labeling construction and its variations. A graph that has a graceful labeling called a graceful graph. A kC4snake graph with k≥1 is a connected graph with k blocks whose block-cutpoint is a path and each block is isomorphic to C4. A thorny-snake graph is a graph constructed from kC4 snake graph by adding two pendants in each main vertices. In this paperwe give the construction of gcraceful on the thorny-snake graphs.