COMPUTATION OF METRIC DIMENSION OF TREE GRAPH, SYMMETRIC CUBIC GRAPH FROM FOSTERâS CENSUS, AND HYPERCUBE GRAPH
Let ????(????,????) be a simple and connected graph. The distance between two vertices ???? and ???? in ???? is the length of a shortest path between these two vertices and its denoted by ????(????,????). Let ????={????1,????2,?,????????} be a subset of ????(????). For every ?????????(????), the rep...
Saved in:
| Main Author: | |
|---|---|
| Format: | Theses |
| Language: | Indonesia |
| Online Access: | https://digilib.itb.ac.id/gdl/view/70905 |
| 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!