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...

Full description

Saved in:
Bibliographic Details
Main Author: Dominic Wibisana, Bartimeus
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
id id-itb.:68367
spelling id-itb.:683672022-09-14T11:12:59ZMULTISET DIMENSION OF AMALGAMATION OF CYCLE GRAPHS Dominic Wibisana, Bartimeus Indonesia Theses metric dimension , multiset dimension, distance. INSTITUT TEKNOLOGI BANDUNG https://digilib.itb.ac.id/gdl/view/68367 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. text
institution Institut Teknologi Bandung
building Institut Teknologi Bandung Library
continent Asia
country Indonesia
Indonesia
content_provider Institut Teknologi Bandung
collection Digital ITB
language Indonesia
description 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.
format Theses
author Dominic Wibisana, Bartimeus
spellingShingle Dominic Wibisana, Bartimeus
MULTISET DIMENSION OF AMALGAMATION OF CYCLE GRAPHS
author_facet Dominic Wibisana, Bartimeus
author_sort Dominic Wibisana, Bartimeus
title MULTISET DIMENSION OF AMALGAMATION OF CYCLE GRAPHS
title_short MULTISET DIMENSION OF AMALGAMATION OF CYCLE GRAPHS
title_full MULTISET DIMENSION OF AMALGAMATION OF CYCLE GRAPHS
title_fullStr MULTISET DIMENSION OF AMALGAMATION OF CYCLE GRAPHS
title_full_unstemmed MULTISET DIMENSION OF AMALGAMATION OF CYCLE GRAPHS
title_sort multiset dimension of amalgamation of cycle graphs
url https://digilib.itb.ac.id/gdl/view/68367
_version_ 1822005723764097024