In this paper some infinite regular graphs generated by tilings of the plane by infinite hexagonal grid are considered. It is proved that these graphs have discrepancies between their metric dimension and partition dimension. Also, it is proved that for every n ≥ 2 there exist finite induced subgraphs of these graphs having metric dimension equal to n as well as infinite induced subgraphs with metric dimension equal to three. It is natural to ask for a characterization of graphs having discrepancies between their metric dimension and partition dimension.