OUTER MULTISET DIMENSION OF GRAPHS WITHINFINITE MULTISET DIMENSION
A multiset dimension of a graph G or md(G) is smallest cardinality of a subset W ? V(G) that uniquely identify all vertices in G by using multiset of distances to vertices inW. A graph G admits md(G) = ? if noW ?V(G) differentiates all vertices in G by their multiset of distances to vertices inW....
Saved in:
| Main Author: | |
|---|---|
| Format: | Final Project |
| Language: | Indonesia |
| Online Access: | https://digilib.itb.ac.id/gdl/view/82079 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Institut Teknologi Bandung |
| Language: | Indonesia |
| Summary: | A multiset dimension of a graph G or md(G) is smallest cardinality of a subset W ?
V(G) that uniquely identify all vertices in G by using multiset of distances to vertices
inW. A graph G admits md(G) = ? if noW ?V(G) differentiates all vertices in G by
their multiset of distances to vertices inW. An outer multiset dimension of a graph G or
dimms(G) is a variation of the multiset dimension by only considering vertices that are
outside W. In this final project, we will study the outer multiset dimension of graphs
with infinite multiset dimensions, such as complete graphs with some edges removed,
wheels, and the corona product of a graph and an edgeless graph. |
|---|