creators_name: NIA ADELIA, 1517031141
creators_id: -
type: other
datestamp: 2022-03-11 08:02:11
lastmod: 2022-03-11 08:02:11
metadata_visibility: show
title: DIMENSI PARTISI GRAF PETERSEN DIPERUMUM 
ispublished: pub
subjects: QA
full_text_status: restricted
abstract: 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 
date: 2019-05-31
date_type: published
publisher: FAKULTAS MATEMATIKA DAN ILMU PENGETAHUAN ALAM
place_of_pub: UNIVERSITAS LAMPUNG
citation:   NIA ADELIA, 1517031141  (2019) DIMENSI PARTISI GRAF PETERSEN DIPERUMUM.  FAKULTAS MATEMATIKA DAN ILMU PENGETAHUAN ALAM, UNIVERSITAS LAMPUNG.     
document_url: http://digilib.unila.ac.id/54397/1/1.%20ABSTRAK.pdf
document_url: http://digilib.unila.ac.id/54397/2/2.%20SKRIPSI%20FULL.pdf
document_url: http://digilib.unila.ac.id/54397/3/3.%20SKRIPSI%20FULL%20TANPA%20BAB%20PEMBAHASAN.pdf