On lower bounds for the metric dimension of graphs
For an ordered set $W=\{w_1, w_2,\ldots,w_k\}$ of vertices and a vertex $v$ in a connected graph $G$, the ordered $k$-vector $r(v|W)=(d(v,w_1),d(v,w_2),\ldots,d(v,w_k))$ is called the (metric) representation of $v$ with respect to $W$, where $d(x,y)$ is the distance between the vertic...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Shahid Bahonar University of Kerman
2023-01-01
|
| Series: | Journal of Mahani Mathematical Research |
| Subjects: | |
| Online Access: | https://jmmrc.uk.ac.ir/article_3323_0e7d6a7d06cce1ec79f2e95dac75ee12.pdf |