Resolving set and exchange property in nanotube
Give us a linked graph, $ G = (V, E). $ A vertex $ w\in V $ distinguishes between two components (vertices and edges) $ x, y\in E\cup V $ if $ d_G(w, x)\neq d_G (w, y). $ Let $ W_{1} $ and $ W_{2} $ be two resolving sets and $ W_{1} $ $ \neq $ $ W_{2} $. Then, we can say that the graph $ G $ has dou...
| Main Authors: | , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
AIMS Press
2023-06-01
|
| Series: | AIMS Mathematics |
| Subjects: | |
| Online Access: | https://www.aimspress.com/article/doi/10.3934/math.20231035?viewType=HTML |