Nilai ketakteraturan refleksif sisi pada Graf Helm (Hn)

Ayun, Zasi Qorrota (2021) Nilai ketakteraturan refleksif sisi pada Graf Helm (Hn). Sarjana thesis, UIN Sunan Gunung Djati Bandung.

Preview	Text (COVER) 1_cover.pdf Download (220kB) | Preview
Preview	Text (ABSTRAK) 2_abstrak.pdf Download (343kB) | Preview
Preview	Text (DAFTAR ISI) 3_daftarisi.pdf Download (496kB) | Preview
Preview	Text (BAB I) 4_bab1.pdf Download (465kB) | Preview
	Text (BAB II) 5_bab2.pdf Restricted to Registered users only Download (782kB) | Request a copy
	Text (BAB III) 6_bab3.pdf Restricted to Registered users only Download (1MB) | Request a copy
	Text (BAB IV) 7_bab4.pdf Restricted to Registered users only Download (340kB) | Request a copy
	Text (DAFTAR PUSTAKA) 8_daftarpustaka.pdf Restricted to Registered users only Download (394kB) | Request a copy

Abstract

INDONESIA: Graf G didefinisikan memiliki pelabelan sisi f_e:E(G)→{1, 2, . . .,k_e } dan pelabelan titik f_v:V(G)→{0, 2, . . ., 2k_v } sehingga f(x)=f_v (x) jika x∈V(G) dan f(x)=f_e (x) jika x∈E(G), dimana k=max{k_e,2k_v}. Pelabelan-k dari f disebut pelabelan-k tak teratur refleksif sisi dari G jika untuk setiap dua sisi berbeda xy dan x'y' terdapat wt(xy)≠wt(x^' y^'). Nilai k terkecil sehingga G memiliki pelabelan-k tak teratur refleksif sisi disebut nilai refleksif sisi dari G dinotasikan dengan res(G). Dalam karya tulis ini, membahas tentang nilai ketakteraturan refleksif sisi pada graf helm (H_n). ENGLISH: The graph is defined to have the edge labeling f_e:E(G)→{1,2,...,k_e }and the labeling of f_v:V(G)→{0,2,...,2k_v } so that f(x)=f_v (x) if x∈V(G) and f(x)=f_e (x) if x∈E (G). The total k-labeling is called an edges irregular reflexive k-labeling of the graph G, if for every two different edges xy and x'y' of G has wt(xy)≠wt(x^' y^'). The smallest value of k for which such labelling exists is called the reflexive edge strength of the graph G and is denoted by res(G). In this paper, discuss the reflexive edge strength of Helm graph (H_n).

Actions (login required)

View Item