METRIC DIMENSION OF DIRECTED GRAPHS WITH CYCLIC COVERING
Let ????! G = (V;E) be a strongly connected directed simple graph with vertex set V and edge set E. For u; v 2 V ( ????! G ), the distance from u to v, d(u; v) is the minimum length of directed paths from u to v. Suppose B = fb1; b2; b3; :::bkg is a nonempty ordered subset of V . The represen...
Saved in:
| Main Author: | |
|---|---|
| Format: | Theses |
| Language: | Indonesia |
| Online Access: | https://digilib.itb.ac.id/gdl/view/34241 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Institut Teknologi Bandung |
| Language: | Indonesia |