On the Families of Graphs With Unbounded Metric Dimension
A family G of connected graphs is a family with unbounded metric dimension if dim(G) is not constant and depends on the order of graph. In this paper, we compute the metric dimension of the splitting graphs S(P<sub>n</sub>) and S(C<sub>n</sub>) of a path and cycle. We prove that the metric dimension...
Guardat en:
| Autors principals: | , , , , |
|---|---|
| Format: | Artigo |
| Idioma: | Inglês |
| Publicat: |
IEEE
2019-01-01
|
| Col·lecció: | IEEE Access |
| Matèries: | |
| Accés en línia: | https://ieeexplore.ieee.org/document/8894000/ |
| Etiquetes: |
Sense etiquetes, Sigues el primer a etiquetar aquest registre!
|