The Metric Dimension of Theta Graph
Let $ G = (V, E) $ be a connected graph with vertex set $ V(G) $ and edge set $ E(G) $. For any two vertices $ u $ and $ v $ in $ G $, the shortest path distance between $ u $ and $v$ is denoted by $d(u, v)$. If $W = \{w_1, w_2, \dots, w_k\}$ is an ordered set of vertices in the connected graph $G$...
Uloženo v:
| Hlavní autoři: | , |
|---|---|
| Médium: | Artigo |
| Jazyk: | Inglês |
| Vydáno: |
Universitas Nusa Cendana
2025-11-01
|
| Edice: | Jurnal Diferensial |
| Témata: | |
| On-line přístup: | https://ejurnal.undana.ac.id/index.php/JD/article/view/20790 |
| Tagy: |
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|