CENTROIDAL DIMENSION
Let B = (Rumus) 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 nondecreasing order by their distance from x. Vertex set B is called a centroidal locating set of G if r(x) 6= r(y) for every pair x;y of distinct vertice...
Saved in:
Main Author: | |
---|---|
Format: | Theses |
Language: | Indonesia |
Subjects: | |
Online Access: | https://digilib.itb.ac.id/gdl/view/32467 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Institut Teknologi Bandung |
Language: | Indonesia |
Be the first to leave a comment!