BILANGAN TERHUBUNG PELANGI KUAT PADA GRAF GURITA, PLANTER DAN FERRIS WHEEL

FITRIA GUSLIANA, . (2023) BILANGAN TERHUBUNG PELANGI KUAT PADA GRAF GURITA, PLANTER DAN FERRIS WHEEL. Sarjana thesis, UNIVERSITAS NEGERI JAKARTA.

[img] Text
COVER.pdf

Download (921kB)
[img] Text
BAB 1.pdf

Download (146kB)
[img] Text
BAB 2.pdf
Restricted to Registered users only

Download (1MB) | Request a copy
[img] Text
BAB 3.pdf
Restricted to Registered users only

Download (337kB) | Request a copy
[img] Text
BAB 4.pdf
Restricted to Registered users only

Download (1MB) | Request a copy
[img] Text
BAB 5.pdf
Restricted to Registered users only

Download (141kB) | Request a copy
[img] Text
DAFTAR PUSTAKA.pdf

Download (111kB)
[img] Text
LAMPIRAN.pdf
Restricted to Registered users only

Download (1MB) | Request a copy

Abstract

Sebuah graf G dikatakan terhubung pelangi kuat apabila terdapat sebuah lintasan pelangi geodesik u − v pada tiap pasang titik u dan v di G. Bilangan terhubung pelangi kuat pada graf G dinotasikan dengan src(G), yakni minimal warna yang dipakai agar graf G terhubung pelangi kuat. Pada penelitian ini akan dibahas tentang bilangan terhubung pelangi kuat pada graf gurita (On), planter (Rn), dan ferris wheel (Fwn). Hasil yang didapatkan adalah src(On) = ⌈ 4n/3⌉ untuk n ≥ 2, src(Rn) = (5n−3 )/6 dimana n = 6k − 3 untuk k ≥ 1, src(Rn) = (5n+4)/ 6 dimana n = 6k − 2 untuk k ≥ 1, src(Rn) = n − k dimana n = 6k + l untuk l = −1, 0, 1, 2 dan k ≥ 1, src(Fwn) = ⌈ n /2 ⌉ untuk 3 ≤ n ≤ 6. A graph G is said to be strongly rainbow connected if there exists a u − v geodesic rainbow intersection at each pair of nodes u and v in G. The strong rainbow connected number is denoted by src, where src is the minimum color used for a graph G to be strongly rainbow connected. In this study, we will discuss the strong rainbow connected number in octopus, planter, and ferris wheel graphs. The result obtained is src(On) = ⌈ 4n /3 ⌉ for n ≥ 2, src(Rn) = (5n−3 )/6 where n = 6k − 3 for k ≥ 1, src(Rn) = (5n+4) /6 where n = 6k − 2 for k ≥ 1, src(Rn) = n − k where n = 6k + l for l = −1, 0, 1, 2 and k ≥ 1, src(Fwn) = ⌈ n /2 ⌉ for 3 ≤ n ≤ 6.

Item Type: Thesis (Sarjana)
Additional Information: 1). Dr. Lukita Ambarwati, S. pd., M. Si. ; 2). Devi Eka Wardani Meganingtyas, S. Pd., M. Si.
Subjects: Sains > Matematika
Divisions: FMIPA > S1 Matematika
Depositing User: Users 18932 not found.
Date Deposited: 08 Sep 2023 06:03
Last Modified: 08 Sep 2023 06:03
URI: http://repository.unj.ac.id/id/eprint/41795

Actions (login required)

View Item View Item