MULTISET DIMENSION OF MỎ̬ BIUS LADDER GRAPH
Multiset Dimension is a variation of metric dimension. <br /> <br /> <br /> <br /> The representation multiset of a vertex v with respect to W,r_m (v|W), is defined as a multiset of distances between v and the vertices in W with their multi- plicities. If r_m (u|W)=r_m (v...
Saved in:
| Main Author: | |
|---|---|
| Format: | Final Project |
| Language: | Indonesia |
| Online Access: | https://digilib.itb.ac.id/gdl/view/25258 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Institut Teknologi Bandung |
| Language: | Indonesia |
| Summary: | Multiset Dimension is a variation of metric dimension. <br />
<br />
<br />
<br />
The representation multiset of a vertex v with respect to W,r_m (v|W), is defined as a multiset of distances between v and the vertices in W with their multi- plicities. If r_m (u|W)=r_m (v|W) for every pair of distinct vertices u,v∈V then W is called a resolving set of G. If G has a resolving set, then the cardinality of a smallest resolving set is called the multiset dimension of G, denoted by md(G). If G does not contain a resolving set, then md(G)=∞. <br />
<br />
<br />
<br />
This research will present the value of multiset dimension of Mo¨bius Ladder Graph. Mo¨bius Ladder Graph with the order n (n is an even positive number), M_n, is isomorphic with circulant graph Ci_2n (1,n), and defined as a cycle with order n which has some more edges connecting v_i and v_(i+n/2) for i∈{1,2,…,n/2}. <br />
|
|---|