DIMENSI METRIK PADA GENERALISASI GRAF ILALANG
| Main Author: | AGUNG SISWAHYUDI, NIZAR |
|---|---|
| Format: | Thesis NonPeerReviewed |
| Terbitan: |
, 2014
|
| Subjects: | |
| Online Access: |
http://eprints.umm.ac.id/15895/ |
Daftar Isi:
- Let ordered set of W={w_1,w_2,Â...,w_k} from vertex on connected graph G and vertex v∈V(G), representation of distance from v to W is k-vector (pair ofk-tuple) in the form of(v│W)=(d(v,w_1 ),d(v,w_2 ),Â...,d(v,w_k )). If r(v│W) for each vertex v∈V(G)is different, so W is called resolving set from V(G). Resolving set with minimum of cardinality is called minimum resolving set, and this cardinality is called metric dimension from G denoted with dim(G). This thesis is theory discussion which uses library research or literature research. The thesis will discuss about metric dimension for generalization ilalang graph. The discussion starts from metric dimension of star graph, ilalang graph then generalization ilalang graph and generalization like reconstruction cayley tree. The thesis is completed with some Lemma to support the proof on theorem and the examples. Based on the result of discussion obtainable general form from metric dimension on generalization of ilalang graph is r_m×Â...×r_2×r_1×r_0×(n-1). Whereas for metric dimension ongeneralitation like cayley tree is (n^2-1)n^m.