Please use this identifier to cite or link to this item:
http://repository.ipb.ac.id/handle/123456789/54762
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.advisor | Mas’oed,Teduh Wulandari | |
dc.contributor.advisor | Hanum,Farida | |
dc.contributor.author | Bahri, Syaiful | |
dc.date.accessioned | 2012-06-08T01:40:20Z | |
dc.date.available | 2012-06-08T01:40:20Z | |
dc.date.issued | 2012 | |
dc.identifier.uri | http://repository.ipb.ac.id/handle/123456789/54762 | |
dc.description.abstract | This manuscript proved that every 𝑇𝑃 -tree and subdivision of 𝑇𝑃 -tree could be labeled by using (k, d)-graceful labeling for every positive integers k and d. (k, d)-graceful labeling on a graph is a graceful labeling with vertices could be labeled using integers, so that the set of vertices were mapped to {0, 1, 2, . . . , 𝑘 + (𝑞 − 1)𝑑} and the set of edges were mapped to {𝑘, 𝑘 + 𝑑, 𝑘 + 2𝑑, . . . , 𝑘 + (𝑞 − 1)𝑑}, with 𝑞 was size on graph. There are two theorems and one corollary to be considered. The first theorem proved that every 𝑇𝑃 -tree could be labeled by using (k, d)-graceful labeling. This theorem resulted a preposition that a (k, d)-graceful labeling is a (k, d)-balanced labeling. The second theorem proved that subdivision of 𝑇𝑃 -tree could be labeled with (k, d)- graceful labeling. | en |
dc.description.abstract | Karya ilmiah ini membuktikan bahwa setiap 𝑇𝑃 -tree dan subdivisi dari 𝑇𝑃 -tree dapat dilabeli dengan pelabelan (k, d)-graceful untuk setiap bilangan bulat positif k dan d. Pelabelan (k, d)- graceful pada suatu graf adalah pelabelan graceful yang simpulnya dapat dilabeli dengan bilangan bulat, sehingga himpunan simpulnya dipetakan ke 0, 1, 2, … , 𝑘 + 𝑞 − 1 𝑑 dan himpunan sisinya dipetakan ke {𝑘, 𝑘 + 𝑑, 𝑘 + 2𝑑, … , 𝑘 + 𝑞 − 1 𝑑}, dengan 𝑞 adalah banyaknya sisi pada suatu graf. Terdapat dua teorema dan satu akibat yang dibahas dalam karya ilmiah ini. Teorema pertama membuktikan bahwa setiap 𝑇𝑃 -tree dapat dilabeli dengan pelabelan (k, d)-graceful. Teorema ini mengakibatkan suatu pernyataan bahwa pelabelan (k, d)-graceful merupakan pelabelan (k, d)- balanced. Teorema kedua membuktikan bahwa subdivisi dari 𝑇𝑃 -tree dapat dilabeli dengan pelabelan (k, d)-graceful | |
dc.subject | Bogor Agricultural University (IPB) | en |
dc.title | Pelabelan (k, d)-graceful pada 𝑇𝑃-tree dan Subdivisi dari 𝑇𝑃-tree | en |
dc.title | k, d)-graceful Labeling on 𝑇𝑃 -tree and Subdivision of 𝑇𝑃 -tree. | |
Appears in Collections: | UT - Mathematics |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
G12sba.pdf Restricted Access | Full text | 2.37 MB | Adobe PDF | View/Open |
G12sba_Abstrak.pdf Restricted Access | Abstrak | 705.25 kB | Adobe PDF | View/Open |
G12sba_BAB I Pendahuluan.pdf Restricted Access | BAB I | 638.13 kB | Adobe PDF | View/Open |
G12sba_BAB II Landasan Teori.pdf Restricted Access | BAB II | 630.82 kB | Adobe PDF | View/Open |
G12sba_BAB III Pembahasan.pdf Restricted Access | BAB III | 798.25 kB | Adobe PDF | View/Open |
G12sba_BAB IV Simpulan dan Saran.pdf Restricted Access | BAB IV | 598.55 kB | Adobe PDF | View/Open |
G12sba_Cover.pdf Restricted Access | Cover | 1.15 MB | Adobe PDF | View/Open |
G12sba_Daftar Pustaka.pdf Restricted Access | daftar pustaka | 849.3 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.