THE MULTISET DIMENSION OF SOME GRAPHS
Let G be a connected graph, u and v be vertices in G, distance d(u,v) be the minimum length of paths connecting u and v in G. Let W={w_1,...,w_k} be an ordered set of vertices in G and v be a vertex in G, the representation of v with respect to W is the k-vector (ordered k-tuple) <br /> <...
Saved in:
| Main Author: | |
|---|---|
| Format: | Theses |
| Language: | Indonesia |
| Online Access: | https://digilib.itb.ac.id/gdl/view/29977 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Institut Teknologi Bandung |
| Language: | Indonesia |