Pelabelan total Sisi Trimagic pada Graf Persahabatan

Zein, Muhammad Hilham (2018) Pelabelan total Sisi Trimagic pada Graf Persahabatan. Diploma thesis, UIN Sunan Gunung Djati Bandung.

Preview	Text (COVER) 1_cover.pdf Download (110kB) | Preview
Preview	Text (DAFTAR ISI) 3_daftarisi.pdf Download (379kB) | Preview
Preview	Text (BAB I) 4_bab1.pdf Download (330kB) | Preview
Preview	Text (ABSTRAK) 2_abstrak.pdf Download (234kB) | Preview
	Text (BAB II) 5_bab2.pdf Restricted to Registered users only Download (633kB) | Request a copy
	Text (BAB III) 6_bab3.pdf Restricted to Registered users only Download (872kB) | Request a copy
	Text (BAB IV) 7_bab4.pdf Restricted to Registered users only Download (138kB) | Request a copy
	Text (DAFTAR PUSTAKA) 8_daftarpustaka.pdf Restricted to Registered users only Download (211kB) | Request a copy

Abstract

Sebuah pelabelan total sisi trimagic dari (p,q) graf adalah bijeksi f:V(G)∪E(G)→{1,2,…,p+q} sehingga untuk setiap sisi uv∈E(G), nilai f(u)+F(uv)+f(v) adalah salah satu konstan dari k_1 atau k_2 atau k_3. Dalam skripsi ini, penulis akan membuktikan bahwa graf persahabatan memenuhi pelabelan total sisi trimagic. Hal ini terlihat berdasarkan hasil pembuktian dimana setiap sisi graf persahabatan akan menghasilkan magic 6n+4, 6n+3, dan 5n+4. Kata kunci : Fungsi, Bijeksi, Pelabelan Trimagic. Abstract Name : Muhammad Hilham Zein Department : Mathemathics Title : Edge Trimagic Total Lebeling Of Friendship Graph An edge trimagic total labeling of a (p,q) graph is a bijection f:V(G)∪E(G)→{1,2,…,p+q} such that for each edge uv∈E(G), the value of f(u)+F(uv)+f(v) is either k1 or k2 or k3. In this paper, the author will prove that the friendship graph meets the edge trimagic total labeling. This is seen based on the results of where every edge of friendship graph will produce magic 6n+4, 6n+3, and 5n+4. Keywords : Function, Bijection, Trimagic labelling.

Actions (login required)

View Item