Abstract
The partition dimension and metric dimension of a connected graph are related as pd(G) ≤ dim(G) + 1. However, the partition dimension may be much smaller than the metric dimension and this phenomena is called a discrepancy between metric dimension and partition dimension [12].In this paper some infinite regular graphs generated by tilings of the plane by regular hexagons are considered. These graphs have no finite metric bases but their partition dimension is finite and is evaluated in some cases.It is natural to ask for the characterization of graphs having discrepancies between their metric and partition dimension.
| Original language | English |
|---|---|
| Pages (from-to) | 3-15 |
| Number of pages | 13 |
| Journal | Utilitas Mathematica |
| Volume | 92 |
| Publication status | Published - Nov 2013 |
| Externally published | Yes |
Keywords
- Induced subgraph
- Infinite regular graph
- Metric dimension
- Partition dimension
- Plane tiling
ASJC Scopus subject areas
- Statistics and Probability
- Statistics, Probability and Uncertainty
- Applied Mathematics