Sharp bounds for partition dimension of generalized Möbius ladders
| Autor: | Hussain Zafar, Khan Junaid Alam, Munir Mobeen, Saleem Muhammad Shoaib, Iqbal Zaffar |
|---|---|
| Jazyk: | angličtina |
| Rok vydání: | 2018 |
| Předmět: | |
| Zdroj: | Open Mathematics, Vol 16, Iss 1, Pp 1283-1290 (2018) |
| Druh dokumentu: | article |
| ISSN: | 2391-5455 |
| DOI: | 10.1515/math-2018-0109 |
| Popis: | The concept of minimal resolving partition and resolving set plays a pivotal role in diverse areas such as robot navigation, networking, optimization, mastermind games and coin weighing. It is hard to compute exact values of partition dimension for a graphic metric space, (G, dG) and networks. In this article, we give the sharp upper bounds and lower bounds for the partition dimension of generalized Möbius ladders, Mm, n, for all n≥3 and m≥2. |
| Databáze: | Directory of Open Access Journals |
| Externí odkaz: |
|