#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| Π)...

Full description

Saved in:
Bibliographic Details
Main Author: SYAH (NIM 10103007), NOVIAN
Format: Final Project
Language:Indonesia
Online Access:https://digilib.itb.ac.id/gdl/view/8839
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Institut Teknologi Bandung
Language: Indonesia
id id-itb.:8839
spelling id-itb.:88392017-09-27T11:43:03Z#TITLE_ALTERNATIVE# SYAH (NIM 10103007), NOVIAN Indonesia Final Project INSTITUT TEKNOLOGI BANDUNG https://digilib.itb.ac.id/gdl/view/8839 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. text
institution Institut Teknologi Bandung
building Institut Teknologi Bandung Library
continent Asia
country Indonesia
Indonesia
content_provider Institut Teknologi Bandung
collection Digital ITB
language Indonesia
description 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.
format Final Project
author SYAH (NIM 10103007), NOVIAN
spellingShingle SYAH (NIM 10103007), NOVIAN
#TITLE_ALTERNATIVE#
author_facet SYAH (NIM 10103007), NOVIAN
author_sort SYAH (NIM 10103007), NOVIAN
title #TITLE_ALTERNATIVE#
title_short #TITLE_ALTERNATIVE#
title_full #TITLE_ALTERNATIVE#
title_fullStr #TITLE_ALTERNATIVE#
title_full_unstemmed #TITLE_ALTERNATIVE#
title_sort #title_alternative#
url https://digilib.itb.ac.id/gdl/view/8839
_version_ 1820664523084791808