The connected partition dimension of truncated wheels
Let G be a connected graph. For a vertex v of G and a subset S of V(G), the distance between v and S is d(v, S) = min Given an ordered k-partition = of V(G), the representation of v with respect to is the k-vector If for each pair of distinct vertices then the k-partition is said to be a resolving p...
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Artigo |
| Sprache: | Inglês |
| Veröffentlicht: |
Taylor & Francis Group
2021-05-01
|
| Schriftenreihe: | AKCE International Journal of Graphs and Combinatorics |
| Schlagworte: | |
| Online-Zugang: | http://dx.doi.org/10.1080/09728600.2021.1966683 |
| Tags: |
Keine Tags, Fügen Sie das erste Tag hinzu!
|