MULTISET DIMENSION OF AMALGAMATION OF CYCLE GRAPHS
The representation multiset of v with respect to W, rm(v|W), is defined as a multiset of distances between v and the vertices in W. If rm(u|W) ?= rm(v|W) for every pair of distinct vertices u and v, then W is called an m ? resolving set of G. If G has an m ? resolving set, then m ? resolving set...
Saved in:
| Main Author: | |
|---|---|
| Format: | Theses |
| Language: | Indonesia |
| Online Access: | https://digilib.itb.ac.id/gdl/view/68367 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Institut Teknologi Bandung |
| Language: | Indonesia |
| Summary: | The representation multiset of v with respect to W, rm(v|W), is defined as a multiset
of distances between v and the vertices in W. If rm(u|W) ?= rm(v|W) for every
pair of distinct vertices u and v, then W is called an m ? resolving set of G. If G
has an m ? resolving set, then m ? resolving set with the minimum cardinality
is called a multiset basis and its cardinality is called the multiset dimension of G,
denoted by md(G). If G has no m ? resolving set, then G has an infinite multiset
dimension and md(G) = ?. In this thesis, the multiset dimension of amalgamation
of two cycle graphs and three cycle graphs will be determined. |
|---|