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

Received: 11 Oct 2016; Published: 11 Oct 2016.
Download
Open Access
Citation Format:
Article Info
Section: Articles
Language: EN
Full Text:
Statistics: 176 248
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.

Article Metrics: