Sharp bounds on partition dimension of hexagonal Möbius ladder

Muhammad Azeem, Muhammad Imran, Muhammad Faisal Nadeem

Research output: Contribution to journalArticlepeer-review

56 Citations (Scopus)

Abstract

Complex 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.

Original languageEnglish
Article number101779
JournalJournal of King Saud University - Science
Volume34
Issue number2
DOIs
Publication statusPublished - Feb 2022

Keywords

  • Bounds of partition dimension
  • Möbius ladder graph
  • Partition dimension
  • Partition resolving sets

ASJC Scopus subject areas

  • General

Fingerprint

Dive into the research topics of 'Sharp bounds on partition dimension of hexagonal Möbius ladder'. Together they form a unique fingerprint.

Cite this