#TITLE_ALTERNATIVE#
For any S V(G) and a vertex v ⊆∈ G, the distance between v and S is d(v, S) = min {d(v, x)| x ∈ S}. For an ordered k-partition Π = {S1, S2,..., Sk} of V(G) and a vertex v of G, the representation of v with respect to Π is the k-vectors r(v| Π)...
Saved in:
| 主要作者: | |
|---|---|
| 格式: | Final Project |
| 語言: | Indonesia |
| 在線閱讀: | https://digilib.itb.ac.id/gdl/view/8839 |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
| 機構: | Institut Teknologi Bandung |
| 語言: | Indonesia |
| 總結: | For any S V(G) and a vertex v ⊆∈ G, the distance between v and S is d(v, S) = min {d(v, x)| x ∈ S}. For an ordered k-partition Π = {S1, S2,..., Sk} of V(G) and a vertex v of G, the representation of v with respect to Π is the k-vectors r(v| Π) = (d(v, S1), d(v, S2),..., d(v, Sk)). The partition Π is called a resolving partition if the k-vectors r(v| Π), v ∈ V(G) are distinct. The minimum k for which there is a resolving k-partition of V(G) is the partition dimension of G (written pd(G)). This final project determines the partition dimensions of Fan (Fn) and Windmill graphs. Precisely, we find the partition dimensions of Fans (Fn) for 4 ≤ n ≤ 13. |
|---|