Metric Dimension Threshold of Graphs
Let G be a connected graph. A subset S of vertices of G is said to be a resolving set of G, if for any two vertices u and v of G there is at least a member w of S such that du,w≠dv,w. The minimum number t that any subset S of vertices G with S=t is a resolving set for G, is called the metric dimensi...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2022-01-01
|
| Series: | Journal of Mathematics |
| Online Access: | http://dx.doi.org/10.1155/2022/1838719 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|