TY  - GEN
CY  - UNIVERSITAS LAMPUNG
ID  - eprints54397
UR  - http://digilib.unila.ac.id/54397/
A1  - NIA ADELIA, 1517031141
Y1  - 2019/05/31/
N2  - 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 
PB  - FAKULTAS MATEMATIKA DAN ILMU PENGETAHUAN ALAM
TI  - DIMENSI PARTISI GRAF PETERSEN DIPERUMUM 
AV  - restricted
ER  -