Infinite graphs with finite metric dimension
Fuente:
arXiv
Guardado en:
| Autores principales: | , , , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2026
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866918449774592000 |
|---|---|
| author | Biró, Csaba Boone, Caroline E. Novick, Beth Torek, Hazel |
| author_facet | Biró, Csaba Boone, Caroline E. Novick, Beth Torek, Hazel |
| contents | We study the metric dimension (strong and weak) of infinite graphs. In particular, our main interest is characterizing infinite graphs with finite dimension. Our main results: (1) graphs with more than one end have infinite strong dimension; (2) for graphs with a finite number of cycles, the weak dimension is finite if and only if the graph has finitely many vertices of degree three, and the strong dimension is finite if and only if the graph has one end and finitely many vertices of degree three. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2604_14405 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Infinite graphs with finite metric dimension Biró, Csaba Boone, Caroline E. Novick, Beth Torek, Hazel Combinatorics 05C63 We study the metric dimension (strong and weak) of infinite graphs. In particular, our main interest is characterizing infinite graphs with finite dimension. Our main results: (1) graphs with more than one end have infinite strong dimension; (2) for graphs with a finite number of cycles, the weak dimension is finite if and only if the graph has finitely many vertices of degree three, and the strong dimension is finite if and only if the graph has one end and finitely many vertices of degree three. |
| title | Infinite graphs with finite metric dimension |
| topic | Combinatorics 05C63 |
| url | https://arxiv.org/abs/2604.14405 |