DIMENSION PARTITION FULL OF GRAF SUBDIVISION AND FULL OF GRAF BIPARTITE
The concept of a resolving set of a graph was first introduced by Slater (1975) as a graph locating set, and by Harary and Melter (1976) independently as a graph resolving set. Furthermore, Chartrand et al. (1998) introduced a variant of a graph resolving set called a resolving partition of a graph....
Saved in:
| Main Author: | |
|---|---|
| Format: | Theses |
| Language: | Indonesia |
| Online Access: | https://digilib.itb.ac.id/gdl/view/16115 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Institut Teknologi Bandung |
| Language: | Indonesia |