The locating number of hexagonal Möbius ladder network

Due to the immense applications of interconnection networks, various new networks are designed and extensively used in computer sciences and engineering fields. Networks can be expressed in the form of graphs, where node become vertex and links between nodes are called edges. To obtain the exact location of a specific node which is unique from all the nodes, several nodes are selected this is called locating/resolving set. Minimum number of nodes in the locating set is called locating number. In this article, we find the exact value of locating number of newly designed hexagonal Mobius ladder network.