ON GRAPH OF ORDER - n, DIAMETER - d AND METRIC DIMENSION n - d - 1
A set of vertices W resolves a connected graph G if every vertex is uniquely determined by its vector of distances to the vertices inW. The metric dimension of G is the minimum cardinality of a resolving set of G. Hernando et.al. [8] characterized all graphs of order n with diameter d and metric...
Saved in:
| Main Author: | |
|---|---|
| Format: | Final Project |
| Language: | Indonesia |
| Subjects: | |
| Online Access: | https://digilib.itb.ac.id/gdl/view/33803 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Institut Teknologi Bandung |
| Language: | Indonesia |
| Summary: | A set of vertices W resolves a connected graph G if every vertex is uniquely determined
by its vector of distances to the vertices inW. The metric dimension of G is the minimum
cardinality of a resolving set of G. Hernando et.al. [8] characterized all graphs of order
n with diameter d and metric dimension n - d. In this thesis, we give several classes of
graph of order n with diameter d and metric dimension n - d - 1. |
|---|