@misc{eprints54397,
           month = {Mei},
           title = {DIMENSI PARTISI GRAF PETERSEN DIPERUMUM },
          author = {1517031141 NIA ADELIA},
         address = {UNIVERSITAS LAMPUNG},
       publisher = {FAKULTAS MATEMATIKA DAN ILMU PENGETAHUAN ALAM},
            year = {2019},
             url = {http://digilib.unila.ac.id/54397/},
        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 {\ensuremath{\Pi}} =
 of
v (G), then representation of v with respect to {\ensuremath{\Pi}} is defined as the k-vector r(v{\ensuremath{|}}{\ensuremath{\Pi}})
= (d(v, ), d(v, ),?., d(v, )). The partition {\ensuremath{\Pi}} is called a resolving partition if the
k-vectors r(v{\ensuremath{|}}{\ensuremath{\Pi}}) 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 }
}