Sharp bounds on partition dimension of hexagonal Möbius ladder
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 cons...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Elsevier
2022-02-01
|
| Series: | Journal of King Saud University: Science |
| Subjects: | |
| Online Access: | http://www.sciencedirect.com/science/article/pii/S1018364721004419 |
| _version_ | 1798025209785090048 |
|---|---|
| author | Muhammad Azeem Muhammad Imran Muhammad Faisal Nadeem |
| author_facet | Muhammad Azeem Muhammad Imran Muhammad Faisal Nadeem |
| author_sort | Muhammad Azeem |
| collection | DOAJ |
| description | 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. |
| first_indexed | 2024-04-11T18:15:03Z |
| format | Article |
| id | doaj.art-3cde493ebb304caba6862cdd8a64d815 |
| institution | Directory Open Access Journal |
| issn | 1018-3647 |
| language | English |
| last_indexed | 2024-04-11T18:15:03Z |
| publishDate | 2022-02-01 |
| publisher | Elsevier |
| record_format | Article |
| series | Journal of King Saud University: Science |
| spelling | doaj.art-3cde493ebb304caba6862cdd8a64d8152022-12-22T04:09:57ZengElsevierJournal of King Saud University: Science1018-36472022-02-01342101779Sharp bounds on partition dimension of hexagonal Möbius ladderMuhammad Azeem0Muhammad Imran1Muhammad Faisal Nadeem2Department of Aerospace Engineering, Faculty of Engineering, University Putra Malaysia, MalaysiaDepartment of Mathematical Sciences, United Arab Emirates University, Al Ain, United Arab Emirates; Corresponding author.Department of Mathematics, COMSATS University Islamabad, Lahore Campus, Lahore PakistanComplex 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.http://www.sciencedirect.com/science/article/pii/S1018364721004419Möbius ladder graphPartition dimensionPartition resolving setsBounds of partition dimension |
| spellingShingle | Muhammad Azeem Muhammad Imran Muhammad Faisal Nadeem Sharp bounds on partition dimension of hexagonal Möbius ladder Journal of King Saud University: Science Möbius ladder graph Partition dimension Partition resolving sets Bounds of partition dimension |
| title | Sharp bounds on partition dimension of hexagonal Möbius ladder |
| title_full | Sharp bounds on partition dimension of hexagonal Möbius ladder |
| title_fullStr | Sharp bounds on partition dimension of hexagonal Möbius ladder |
| title_full_unstemmed | Sharp bounds on partition dimension of hexagonal Möbius ladder |
| title_short | Sharp bounds on partition dimension of hexagonal Möbius ladder |
| title_sort | sharp bounds on partition dimension of hexagonal mobius ladder |
| topic | Möbius ladder graph Partition dimension Partition resolving sets Bounds of partition dimension |
| url | http://www.sciencedirect.com/science/article/pii/S1018364721004419 |
| work_keys_str_mv | AT muhammadazeem sharpboundsonpartitiondimensionofhexagonalmobiusladder AT muhammadimran sharpboundsonpartitiondimensionofhexagonalmobiusladder AT muhammadfaisalnadeem sharpboundsonpartitiondimensionofhexagonalmobiusladder |