On the Dominant Local Resolving Set of Vertex Amalgamation Graphs

Basically, the new topic of the dominant local metric dimension which be symbolized by Ddim_l (H) is a combination of two concepts in graph theory, they were called the local metric dimension and dominating set. There are some terms in this topic that is dominant local resolving set and dominant loc...

Full description

Saved in:
Bibliographic Details
Main Authors: Reni Umilasari, Liliek Susilowati, S Slamin, Savari Prabhu
Format: Article
Language:English
Published: Mathematics Department UIN Maulana Malik Ibrahim Malang 2023-05-01
Series:Cauchy: Jurnal Matematika Murni dan Aplikasi
Subjects:
Online Access:https://ejournal.uin-malang.ac.id/index.php/Math/article/view/18891
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Basically, the new topic of the dominant local metric dimension which be symbolized by Ddim_l (H) is a combination of two concepts in graph theory, they were called the local metric dimension and dominating set. There are some terms in this topic that is dominant local resolving set and dominant local basis. An ordered subset W_l is said a dominant local resolving set of G if W_l is dominating set and also local resolving set of G. While dominant local basis is a dominant local resolving set with minimum cardinality. This study uses literature study method by observing the local metric dimension and dominating number before detecting the dominant local metric dimension of the graphs. After obtaining some new results, the purpose of this research is how the dominant local metric dimension of vertex amalgamation product graphs. Some special graphs that be used are star, friendship, complete graph and complete bipartite graph. Based on all observation results, it can be said that the dominant local metric dimension for any vertex amalgamation product graph depends on the dominant local metric dimension of the copied graphs and how the terminal vertex is constructed
ISSN:2086-0382
2477-3344