Widiyaningsih, Melani (2017) Implementasi Algoritma Knuth-Morris-Pratt (KMP) pada Aplikasi Kamus Bebasan-Indonesia Berbasis Speech Recognition. Sarjana thesis, UIN Sunan Gunung Djati Bandung.
|
Text (COVER)
cover.pdf Download (424kB) | Preview |
|
|
Text (ABSTRAK)
abstrak.pdf Download (667kB) | Preview |
|
|
Text (DAFTAR ISI)
daftar isi.pdf Download (666kB) | Preview |
|
|
Text (BAB I)
bab 1.pdf Download (1MB) | Preview |
|
![[img]](https://digilib.uinsgd.ac.id/style/images/fileicons/text.png) |
Text (BAB II)
bab 2.pdf Restricted to Registered users only Download (5MB) |
|
|
Text (BAB III)
bab 3.pdf Restricted to Registered users only Download (22MB) |
|
|
Text (DAFTAR PUSTAKA)
daftar pustaka.pdf Restricted to Registered users only Download (475kB) |
Abstract
ABSTRAK Nama : Melani Widiyaningsih Jurusan : Matematika Sains Judul : Pelabelan L(2,1) pada Graf Hasil Operasi Comb antara Dua Buah Graf Lingkaran Pelabelan L(2,1) pada graf G adalah suatu fungsi dari himpunan titik V(G) ke himpunan bilangan bulat non-negatif, sehingga |f(x) − f(y)| ≥ 2 jika d(x,y) = 1 dan |f(x) − f(y)| ≥ 1 jika d(x,y) = 2. Bilangan pelabelan L(2,1) dari graf G, dinotasikan dengan λ(G), adalah nilai k terkecil sehingga G memiliki pelabelan L(2,1) dengan label terbesar k. Pada skripsi ini, akan ditentukan nilai pelabelan L(2,1) pada graf hasil operasi comb antara dua buah graf lingkaran yang dinotasikan dengan Cₙ ⋄ Cₘ. Berdasarkan hasil penelitian, terbukti bahwa Cₙ ⋄ Cₘ dapat dilabeli dengan pelabelan L(2,1). Kata kunci: Pelabelan, pelabelan L(2,1), graf lingkaran, operasi comb. ABSTRACT Name : Melani Widiyaningsih Department : Mathematics Science Title : An L(2,1)-Labeling of Comb Product Graph of Two Cycles An L(2,1)-labeling of a graph G is a function f that maps the set of all vertices V(G) to non-negative integers, such that |f(x) − f(y)| ≥ 2 if d(x,y) = 1 and |f(x) − f(y)| ≥ 1 if d(x,y) = 2. The L(2,1)-labeling number of G, denoted by λ(G), is the smallest number k such that G has an L(2,1)-labeling with the largest label k. In this undergraduate thesis, the L(2,1)-labeling number of the comb product graph of two cycles, denoted by Cₙ ⋄ Cₘ, will be determined. Based on the research, it is proven that Cₙ ⋄ Cₘ can be labeled with an L(2,1)-labeling. Keywords: Labeling, L(2,1)-labeling, cycle graph, comb product graph.
| Item Type: | Thesis (Sarjana) |
|---|---|
| Additional Information: | Tidak ada bab 4 dan lampiran |
| Uncontrolled Keywords: | Algoritma |
| Subjects: | Data Processing, Computer Science > Computer Science Education |
| Divisions: | Fakultas Sains dan Teknologi > Program Studi Teknik Informatika |
| Depositing User: | PKL6 SMKN 11 GARUT |
| Date Deposited: | 08 Oct 2026 08:35 |
| Last Modified: | 08 Oct 2026 08:35 |
| URI: | https://digilib.uinsgd.ac.id/id/eprint/120614 |
Actions (login required)
 |
View Item |
