Sharp bounds for partition dimension of generalized Möbius ladders
Faculty / School
Faculty of Computer Sciences (FCS)
Department of Mathematical Sciences
Was this content written or created while at IBA?
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.
HJRS - X Category, Scopus, Web of Science - Science Citation Index Expanded (SCI)
Journal Quality Ranking
Impact Factor: 0.726
Hussain, Z., Khan, J. A., Munir, M., Saleem, M. S., & Iqbal, Z. (2018). Sharp bounds for partition dimension of generalized Möbius ladders. Open Mathematics, 16 (1), 1283-1290. Retrieved from https://ir.iba.edu.pk/faculty-research-articles/170