Architectural metamaterials that span different length scales and are either self-similar or dissimilar to one another make up hierarchical lattices. Comparing hierarchical lattices to traditional ones reveals that they offer superior and customizable properties, which allows for a wide variety of material property manipulation and optimization. Each computer network can be represented as a graph, where nodes alternate as vertices and links are edges. The recent advanced topic of resolvability parameters of a graph involves shaping the entire structure to obtain each nodes' specific position. In this article, we computed the metric, fault metric, and partition dimension of the hierarchal lattic tube. The application of the metric dimension is also covered in this paper.