Odd Graceful Labeling of W -Tree W T ( n , k ) and its Disjoint Union

Abstract

Let G=(V(G),E(G)) be a graph with p vertices and q edges. A graph G of size q is said to be odd graceful if there exists an injection λ:V(G)→0,1,2,…,2q−1 such that assigning each edge xy the label or weight |λ(x)–λ(y)| results in the set of edge labels being 1,3,5,…,2q−1. This concept was introduced in 1991 by Gananajothi. In this paper, we examine the odd graceful labeling of the W-tree, denoted as WT(n,k).