
تعداد نشریات | 43 |
تعداد شمارهها | 1,704 |
تعداد مقالات | 13,954 |
تعداد مشاهده مقاله | 33,451,274 |
تعداد دریافت فایل اصل مقاله | 13,266,764 |
On metric dimension of edge comb product of vertex-transitive graphs | ||
Transactions on Combinatorics | ||
مقاله 6، دوره 14، شماره 1، خرداد 2025، صفحه 45-64 اصل مقاله (629.31 K) | ||
نوع مقاله: Research Paper | ||
شناسه دیجیتال (DOI): 10.22108/toc.2024.133850.1991 | ||
نویسندگان | ||
Tita Khalis Maryati1؛ Dindin Sobiruddin1؛ Maifalinda Fatra1؛ Fawwaz Fakhrurrozi Hadiputra* 2 | ||
1Department of Mathematics Education, Syarif Hidayatullah State Islamic University Jakarta, Indonesia | ||
2Department of Mathematics, Faculty of Mathematics and Natural Sciences, Bandung Institute of Technology, Indonesia | ||
چکیده | ||
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. | ||
کلیدواژهها | ||
Metric Dimension؛ Edge Comb Product؛ Trees؛ Vertex-Transitive | ||
مراجع | ||
[1] Z. Y. Awanis, A. N. M. Salman and S. W. Saputro, The strong 3-rainbow index of edge-comb product of a path and a connected graph, Electron. J. Graph Theory Appl. (EJGTA), 10 no. 1 (2022) 33–50. [5] H. Fernau, P. Heggernes, P. van’t Hof, D. Meister and R. Saei, Computing the metric dimension for chain graphs, Inform. Process. Lett., 115 (2015) 671–676. | ||
آمار تعداد مشاهده مقاله: 203 تعداد دریافت فایل اصل مقاله: 195 |