Sharp bounds on partition dimension of hexagonal Mobius ladder

Complex networks are not easy to decode and understand to work on it, similarly, the Mobius structure is also considered as a complex structure or geometry. But making a graph of every complex and huge structure either chemical or computer-related networks becomes easy. After making easy of its construc-tion, recognition of each vertex (node or atom) is also not an easy task, in this context resolvability parameters plays an important role in controlling or accessing each vertex with respect to some chosen vertices called as resolving set or sometimes dividing entire cluster of vertices into further subparts (sub -sets) and then accessing each vertex with respect to build in subsets called as resolving partition set. In these parameters, each vertex has its own unique identification and is easy to access despite the small or huge structures. In this article, we provide a resolving partition of hexagonal Mobius ladder graph and discuss bounds of partition dimension of hexagonal Mobius ladder network. (c) 2021 The Authors. Published by Elsevier B.V. on behalf of King Saud University. This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/).

Automated summary

Complex networks and Mobius structures are difficult to decode and understand. The identification of each vertex is also challenging. Resolvability parameters play a crucial role in controlling or accessing the vertices, making it easier to access each vertex.