Permata, 1327031015 (2016) REPRESENTASI DAN PENENTUAN BANYAKNYA GRAF BERLABEL TANPA SISI PARALEL BERORDE MAKSIMAL EMPAT. Masters thesis, Universitas Lampung.
|
Text
ABSTRAK.pdf Download (24kB) | Preview |
|
|
Text
ABSTRACT.pdf Download (28kB) | Preview |
|
|
Text
COVER DALAM.pdf Download (31kB) | Preview |
|
|
Text
PERSETUJUAN.pdf Download (674kB) | Preview |
|
|
Text
PENGESAHAN.pdf Download (697kB) | Preview |
|
|
Text
PERNYATAAN.pdf Download (175kB) | Preview |
|
|
Text
RIWAYAT HIDUP.pdf Download (6kB) | Preview |
|
|
Text
PERSEMBAHAN.pdf Download (4kB) | Preview |
|
|
Text
MOTTO.pdf Download (55kB) | Preview |
|
|
Text
SANWACANA.pdf Download (56kB) | Preview |
|
|
Text
DAFTAR ISI.pdf Download (9kB) | Preview |
|
|
Text
DAFTAR GAMBAR.pdf Download (7kB) | Preview |
|
|
Text
DAFTAR TABEL.pdf Download (101kB) | Preview |
|
|
Text
DAFTAR LAMPIRAN.pdf Download (4kB) | Preview |
|
|
Text
BAB I.pdf Download (38kB) | Preview |
|
|
Text
BAB II.pdf Download (401kB) | Preview |
|
|
Text
BAB III.pdf Download (52kB) | Preview |
|
![[img]](http://digilib.unila.ac.id/style/images/fileicons/text.png) |
Text
BAB IV.pdf Restricted to Registered users only Download (684kB) |
|
|
Text
BAB V.pdf Download (116kB) | Preview |
|
|
Text
DAFTAR PUSTAKA.pdf Download (8kB) | Preview |
Abstract
Suatu graf G (V,E) adalah suatu struktur yang terdiri dari himpunan titik V; dan himpunan sisi E dan graf G dikatakan terhubung jika untuk setiap dua titik di G, terdapat path yang menghubungkan kedua titik tersebut. Jika tidak ada path yang menghubungkan maka G dikatakan tidak terhubung. Jika suatu graf hanya titik-titiknya diberi label maka pelabelan disebut pelabelan titik. Sisi paralel adalah dua sisi atau lebih yang memiliki dua titik yang sama. Jika diberikan n titik dan m sisi, terdapat banyak graf yang dapat dibentuk, baik terhubung atau tidak terhubung. Penelitian ini dilakukan dengan tujuan untuk menentukan banyak graf berlabel tanpa sisi paralel dan membangun sistem untuk perhitungannya jika diberikan n=1,2,3,4 dan m=1,2,3,... . Kata kunci : pelabelan titik, graf tak terhubung, graf terhubung, sisi paralel. A graph G (V, E) is a structure that consists of the set of vertices V; and the set of edges E and a graph G is said to be connected if for every pair of vertices in G, there is a path connecting them. If only every vertex is labeled then the graph is called as graph with vertex labelling, if only every edge is labeled then graph is called as edge labelling; and if both vertices and edges are labeled then the graph is called graph with total labelling. Parallel edges are two edges or more that have the same end points. The aim of this research is to determine the number of labeled graphs without parallel edges and establish a system for n=1,2,3,4 and m=1,2,3,... . Keywords: labelling vertex, disconnected graph, connected graph, parallel edges.
| Item Type: | Thesis (Masters) |
|---|---|
| Subjects: | Q Science (General) > QA Mathematics |
| Divisions: | Fakultas MIPA > Prodi Magister Ilmu Matematika |
| Depositing User: | 316282 . Digilib |
| Date Deposited: | 25 Feb 2016 01:48 |
| Last Modified: | 25 Feb 2016 01:48 |
| URI: | http://digilib.unila.ac.id/id/eprint/21206 |
Actions (login required)
 |
View Item |