Odd gracefulness of the chain of trim kite graph and bipartite graph

Abstract

  In graph theory, graph labeling technique was first introduced in the mid 1990's. Most of the graph labeling methods had their origin from the graceful labeling which was first introduced by Rosa (A. Rosa (1967). On certain valuations of the vertices of a graph, Theory of Graphs (Internat. Symposium, Rome, July 1966), Gordon and Breach, New York and Dunod Paris, 349-355) in the year 1967. Odd graceful labeling is one such method introduced by Gnanjothi (R.B. Gnanajothi, Topics in Graph Theory, Ph. D. Thesis, Madurai Kamaraj University, Tamil Nadu, India (1991)) in the year 1991. In this paper we  prove that the chain of a trim kite graph and a bipartite graph is odd graceful.