Further new results on strong resolving partitions for graphs
A set W of vertices of a connected graph G strongly resolves two different vertices x, y ∉ W if either d G(x, W) = d G(x, y) + d G(y, W) or d G(y, W) = d G(y, x) + d G(x, W), where d G(x, W) = mi...
Guardat en:
| Autors principals: | , |
|---|---|
| Format: | Artigo |
| Idioma: | Inglês |
| Publicat: |
De Gruyter
2020-05-01
|
| Col·lecció: | Open Mathematics |
| Matèries: | |
| Accés en línia: | https://doi.org/10.1515/math-2020-0142 |
| Etiquetes: |
Sense etiquetes, Sigues el primer a etiquetar aquest registre!
|