ON THE LOCAL METRIC DIMENSION OF LINE GRAPHS
Let G = (V;E) be a connected graph. The distance between two vertices u and v in G, denoted by dG(u; v), is the length of a shortest u ???? v path. Suppose W = fw1;w2; : : : ;wkg be an ordered nonempty subset of vertices of G and let v is a vertex in G. The representation of vertex v with respect...
Saved in:
| Main Author: | |
|---|---|
| Format: | Theses |
| Language: | Indonesia |
| Subjects: | |
| Online Access: | https://digilib.itb.ac.id/gdl/view/34813 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Institut Teknologi Bandung |
| Language: | Indonesia |