On Metric Dimension of Edge Comb Product of Symmetric Graphs
Consider a finite graph G that is simple, undirected, and connected. Let W be an ordered set of vertices with |W| = k. The representation of a vertex v is defined as an ordered k-tuple that consists of the distances from vertex v to each vertex in W. The set W is called a resolving set for G if the...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Department of Mathematics, Faculty of Mathematics and Natural Sciences, Universitas Andalas
2024-10-01
|
| Series: | Jurnal Matematika UNAND |
| Subjects: | |
| Online Access: | https://jmua.fmipa.unand.ac.id/index.php/jmua/article/view/1273 |