Pelabelan Rata-rata Titik Ganjil dan Rata-rata Titik Genap pada Graf K_2□□(P_n ),K_3□□(P_n ), dan K_4□□(P_n )

Aprila, Barlianty (2018) Pelabelan Rata-rata Titik Ganjil dan Rata-rata Titik Genap pada Graf K_2□□(P_n ),K_3□□(P_n ), dan K_4□□(P_n ). Diploma thesis, UIN Sunan Gunung Djati Bandung.

Preview	Text (COVER) 1_cover.pdf Download (285kB) | Preview
Preview	Text (ABSTRAK) 2_abstrak.pdf Download (294kB) | Preview
Preview	Text (DAFTAR ISI) 3_daftarisi.pdf Download (282kB) | Preview
Preview	Text (BAB I) 4_bab1.pdf Download (297kB) | Preview
	Text (BAB II) 5_bab2.pdf Restricted to Registered users only until 26 February 2018. Download (831kB) | Request a copy
	Text (BAB III) 6_bab3.pdf Restricted to Registered users only until 26 February 2018. Download (1MB) | Request a copy
	Text (BAB IV) 7_bab4.pdf Restricted to Registered users only until 26 February 2018. Download (320kB) | Request a copy
	Text (DAFTAR PUSTAKA) 8_daftarpustaka.pdf Restricted to Registered users only until 26 February 2018. Download (483kB) | Request a copy

Abstract

Misalkan G=(V,E) adalah suatu graf dengan q sisi dikatakan graf rata-rata titik ganjil jika terdapat fungsi satu-satu f:V(G)→{1,3,5,…,2q-1} sehingga ketika setiap sisi uv dilabelkan dengan f^* (e=(u,v))=(f(u)+f(v))/2 maka menghasilkan sisi yang berbeda, dan disebut pelabelan rata-rata titik genap jika terdapat fungsi satu-satu f:V(G)→{2,4,6,…,2q} sehingga ketika setiap sisi uv dilabelkan dengan f^* (e=(u,v))=(f(u)+f(v))/2 menghasilkan sisi yang berbeda. Pada skripsi ini akan dikaji mengenai pelabelan rata-rata titik ganjil dan rata-rata titik genap pada graf hasil operasi kartesius, diantaranya K_2□P_n, K_3□P_n, dan K_4□P_n. ABSTRACT Name : Barlianty Aprila Department : Mathematics Title : Vertex Odd Mean and Even Mean Labeling Of Graphs K_2□P_n, K_3□P_n, and K_4□P_n Let G=(V,E) is a Graph with q edges. A labeling f to be an vertex odd mean graph there is an injective function f:V(G)→{1,3,5,…,2q-1} such that when each edge uv is labeled f^* (e=(u,v))=(f(u)+f(v))/2 then the resulting edges are distinct, and to be an vertex even mean graph there is an injective function f:V(G)→{2,4,6,…,2q} such that when each edge uv is labeled f^* (e=(u,v))=(f(u)+f(v))/2 then the resulting edges are distinct. In this final project, will be vertex odd mean and even mean labeling of graphs cartesian product, that is K_2□P_n, K_3□P_n, and K_4□P_n.

Actions (login required)

View Item