PELABELAN GRACEFUL SISI-GANJIL PADA GRAF WEB W(2,n)

Abstract

Let G = (V(G),E(𝐺)) be a graph with vertex set 𝑉(𝐺) and edge set 𝐸(𝐺). Assume that graph G have 𝑞 edge. Graceful edge-odd labeling is a bijective map  𝑓 ∶ 𝐸(𝐺) →  {1, 3, 5,…,2𝑞 – 1} that resulting map 𝑓⁺ : 𝑉(𝐺) → {0,1,2,…,2𝑞 −1} with  such as obtained different edge label. Graph G ia called Graceful edge-odd labeling if there is graceful edge-odd labeling on G. Let  and  are two cycle graph with vertex set  and . Graph  is obtained by conected every vertex from  to   such as we have edge  Graph Web W(2,n) is a graph obtained by adding a pendant edge on each outer cycle vertex from graph . In this paper we will discussed about Graceful edge-odd labeling on Web (2,𝑛) graph and we have that Web W(2,𝑛) graph is graceful edge odd graph for n odd.