NIA ADELIA, 1517031141 (2019) DIMENSI PARTISI GRAF PETERSEN DIPERUMUM. FAKULTAS MATEMATIKA DAN ILMU PENGETAHUAN ALAM, UNIVERSITAS LAMPUNG.
|
File PDF
1. ABSTRAK.pdf Download (252Kb) | Preview |
|
![[img]](http://digilib.unila.ac.id/style/images/fileicons/text.png) |
File PDF
2. SKRIPSI FULL.pdf Restricted to Hanya staf Download (2373Kb) |
|
|
File PDF
3. SKRIPSI FULL TANPA BAB PEMBAHASAN.pdf Download (2372Kb) | Preview |
Abstrak (Berisi Bastraknya saja, Judul dan Nama Tidak Boleh di Masukan)
Let G be a connected graph G = (V, E), with V(G) ≠ denotes the set of vertex and E(G) denotes the set of edge. The distance v to S for v (G) and S ⊂ V(G) is defined as d(v,S) = min{d(v,x), x }. For an ordered k-partition Π = of v (G), then representation of v with respect to Π is defined as the k-vector r(v|Π) = (d(v, ), d(v, ),…., d(v, )). The partition Π is called a resolving partition if the k-vectors r(v|Π) are distinct. The minimum for which there is a resolving k-partition of (G) is the partition dimension pd(G) of G. In this study, the partition dimension of generalized Petersen graph
| Jenis Karya Akhir: | Skripsi |
|---|---|
| Subyek: | > QA Mathematics |
| Program Studi: | FAKULTAS MIPA > Prodi Matematika |
| Pengguna Deposit: | AM.d Firlia Hidayah |
| Date Deposited: | 11 Mar 2022 08:02 |
| Terakhir diubah: | 11 Mar 2022 08:02 |
| URI: | http://digilib.unila.ac.id/id/eprint/54397 |
Actions (login required)
 |
Lihat Karya Akhir |
