BibTex Citation Data :
@article{JM12268, author = {Putri Rizky and Lucia Ratnasari and Djuwandi .}, title = {PELABELAN GRACEFUL SISI-GANJIL PADA GRAF WEB W(2,n)}, journal = {MATEMATIKA}, volume = {17}, number = {1}, year = {2016}, keywords = {}, 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. }, url = {https://ejournal.undip.ac.id/index.php/matematika/article/view/12268} }
Refworks Citation Data :
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.
Last update:
Last update: 2024-11-07 16:35:36