GRAPHS WITH MINIMUM OR MAXIMUM LOCAL METRIC DIMENSION
Let W = fw1;w2; :::;wkg be an ordered set consisting of k distinct vertices in a nontrivial connected graph G. The metric representation of a vertex v in G with respect to W is the k-vector r(vjW) = (d(v;w1); d(v;w2); :::; d(v;wk)) where d(v;wi) represents the distance between v and wi for some...
Saved in:
| Main Author: | |
|---|---|
| Format: | Final Project |
| Language: | Indonesia |
| Online Access: | https://digilib.itb.ac.id/gdl/view/42078 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Institut Teknologi Bandung |
| Language: | Indonesia |