Pohon Maksimal Sisi Berbilangan Kromatik Lokasi Tiga

Triani, 1117031057 (2015) Pohon Maksimal Sisi Berbilangan Kromatik Lokasi Tiga. Fakultas Matematika dan Ilmu Pengetahuan Alam, Universitas Lampung.

[img]
Preview
File PDF
ABSTRACT.pdf

Download (25Kb) | Preview
[img]
Preview
File PDF
COVER DALAM.pdf

Download (120Kb) | Preview
[img]
Preview
File PDF
LEMBAR PERSETUJUAN.pdf

Download (132Kb) | Preview
[img]
Preview
File PDF
LEMBAR PENGESAHAN.pdf

Download (128Kb) | Preview
[img]
Preview
File PDF
LEMBAR PERNYATAAN.pdf

Download (128Kb) | Preview
[img]
Preview
File PDF
RIWAYAT HIDUP.pdf

Download (7Kb) | Preview
[img]
Preview
File PDF
PERSEMBAHAN.pdf

Download (14Kb) | Preview
[img]
Preview
File PDF
MOTO.pdf

Download (18Kb) | Preview
[img]
Preview
File PDF
SANWACANA.pdf

Download (59Kb) | Preview
[img]
Preview
File PDF
DAFTAR ISI.pdf

Download (81Kb) | Preview
[img]
Preview
File PDF
DAFTAR GAMBAR.pdf

Download (96Kb) | Preview
[img]
Preview
File PDF
BAB I.pdf

Download (171Kb) | Preview
[img]
Preview
File PDF
BAB II.pdf

Download (267Kb) | Preview
[img]
Preview
File PDF
BAB III.pdf

Download (81Kb) | Preview
[img] File PDF
BAB IV.pdf
Restricted to Hanya pengguna terdaftar

Download (335Kb)
[img]
Preview
File PDF
BAB V.pdf

Download (6Kb) | Preview
[img]
Preview
File PDF
DAFTAR PUSTAKA.pdf

Download (73Kb) | Preview

Abstrak (Berisi Bastraknya saja, Judul dan Nama Tidak Boleh di Masukan)

ABSTRACT Let c be a proper k-coloring of a connected graph G. Let be a induced partition of V(G) by c, where is the partition class having all vertices with color i. The color code of vertex v is the ordered k-tuple , where , for If all vertices of G have distinct color codes, then c is called a locating-coloring of G. The locating-chromatic number of G, denoted by A tree has locating-chromatic number three if only if T is either a path or , a double star or or a subtree containing that isomorphic of either or . By attaching a path of arbitrary lenght to each vertex in a tree that has locating-chromatic number three, then it formed trees with locating-chromatic number four. Key-words : Locating-chromatic number, graph, tree.

Jenis Karya Akhir: Skripsi
Subyek:
Program Studi: FAKULTAS MIPA > Prodi Matematika
Pengguna Deposit: 4925656 . Digilib
Date Deposited: 16 Feb 2015 06:55
Terakhir diubah: 16 Feb 2015 07:07
URI: http://digilib.unila.ac.id/id/eprint/7085

Actions (login required)

Lihat Karya Akhir Lihat Karya Akhir