CENTROIDAL DIMENSION
Let B={w_1,w_2,…,w_k}⊆V(G) be a set of vertices, and x be any vertex in G. We denote r(x) as an ordered partition of B, that is a list of subsets of B in non-decreasing order by their distance from x. Vertex set B is called a centroidal locating set of G if r(x)≠r(y) for every...
Saved in:
Main Author: | |
---|---|
Format: | Theses |
Language: | Indonesia |
Online Access: | https://digilib.itb.ac.id/gdl/view/26276 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Institut Teknologi Bandung |
Language: | Indonesia |