文章基本信息

标题：Sharp bounds on partition dimension of hexagonal Möbius ladder
本地全文：下载
作者：Muhammad Azeem ; Muhammad Azeem ; Muhammad Imran 等
期刊名称：Journal of King Saud University - Science
印刷版ISSN：1018-3647
出版年度：2022
卷号：34
期号：2
页码：1-7
DOI：10.1016/j.jksus.2021.101779
语种：English
出版社：Elsevier
摘要：AbstractComplex networks are not easy to decode and understand to work on it, similarly, the Möbius 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 construction, 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 (subsets) 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 Möbius ladder graph and discuss bounds of partition dimension of hexagonal Möbius ladder network.
关键词：Möbius ladder graph;Partition dimension;Partition resolving sets;Bounds of partition dimension