Abstract

In 1991, Gnanajothi [3] introduced a labeling method called odd graceful labeling. A graph G with q edges is said to be odd graceful if there is an injection f from V (G) → {0,1,2,...(2q-1)} such that, when each edge xy is assigned the label |f(x)-f(y)|, the resulting edge labels are 1,3,5,..(2q-1). In this paper, we prove the odd gracefulness on trees of diameter four with cycle.

Keywords and Phrases

Odd graceful labeling, Cycle, Tress of Diameter four.

A.M.S. subject classification

05C78.

.....