%0 Generic
%A NIA ADELIA, 1517031141
%C UNIVERSITAS LAMPUNG
%D 2019
%F eprints:54397
%I FAKULTAS MATEMATIKA DAN ILMU PENGETAHUAN ALAM
%T DIMENSI PARTISI GRAF PETERSEN DIPERUMUM 
%U http://digilib.unila.ac.id/54397/
%X 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