GRAPHS WITH MINIMUM METRIC DIMENSION
Let G be a connected graph. The distance between two vertices u and v in G, denoted by d(u; v), is the length of the shortest path between u and v in G. If W = fw1;w2; : : : ;wkg is an ordered subset of vertices of G, then the metric representation of u with respect to W is the k-vector r(ujW) =...
Saved in:
| Main Author: | |
|---|---|
| Format: | Final Project |
| Language: | Indonesia |
| Online Access: | https://digilib.itb.ac.id/gdl/view/38494 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Institut Teknologi Bandung |
| Language: | Indonesia |