MAGIC DOMINATING SETS OF GRAPHS
A multiset representation rm(v|W) of a vertex v in a graph G with respect to a subset W ? V (G) is a multiset of distances between v and all vertices in W. If rm(v|W) is distinct for every v in V (G), W is called an m?resolving set of G. The smallest cardinality of an m?resolving set of G is call...
Saved in:
| Main Author: | |
|---|---|
| Format: | Theses |
| Language: | Indonesia |
| Online Access: | https://digilib.itb.ac.id/gdl/view/65100 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Institut Teknologi Bandung |
| Language: | Indonesia |
Be the first to leave a comment!