On metric dimension of edge comb product of vertex-transitive graphs
نویسندگان
1 Department of Mathematics Education, Syarif Hidayatullah State Islamic University Jakarta, Indonesia
2 Department of Mathematics Education, Syarif Hidayatullah State Islamic University Jakarta, Indonesia
3 Department of Mathematics Education, Syarif Hidayatullah State Islamic University Jakarta, Indonesia
4 Department of Mathematics, Faculty of Mathematics and Natural Sciences, Bandung Institute of Technology, Indonesia
doi
10.22108/toc.2024.133850.1991چکیده
Suppose finite graph $G$ is simple, undirected and connected. If $W$ is an ordered set of the vertices such that $|W| = k$, the representation of a vertex $v$ is an ordered $k$-tuple consisting distances of vertex $v$ with every vertices in $W$. The set $W$ is defined as resolving vertex of $G$ if the $k$-tuples of every two vertices are distinct. Metric dimension of $G$, which is denoted by $dim(G)$, is the lowest size of $W$. In this paper, we provide a sharp lower bound of metric dimension for edge comb product graphs $G \cong T$ ▷e $H$ where $T$ is a tree graph and $H$ is a vertex-transitive graph. Moreover, we determine the exact value of metric dimension for edge comb product graphs $G \cong T$ ▷e $Ci_n(1,2)$ where $Ci_n(1,2)$ is a circulant graph.
