THE NON-ISOLATED RESOLVING NUMBER OF CARTESIAN PRODUCT OF ANY GRAPHS WITH A CERTAIN GRAPH
Let G be a simple, connected, and finite graph. For an ordered subset W = fw1;w2; ;wkg of vertices in a graph G and a vertex v of G, the representation of v 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 the vertices v and w...
Saved in:
| Main Author: | |
|---|---|
| Format: | Dissertations |
| Language: | Indonesia |
| Online Access: | https://digilib.itb.ac.id/gdl/view/71452 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Institut Teknologi Bandung |
| Language: | Indonesia |