Title

Sharp bounds for partition dimension of generalized Möbius ladders

Author Affiliation

Junaid Alam Khan is Assistant Professor and Chairperson of Mathematica l Sciences at Institute of Business Administration (IBA), Karachi

Faculty / School

Faculty of Computer Sciences (FCS)

Department

Department of Mathematical Sciences

Was this content written or created while at IBA?

Yes

Document Type

Article

Source Publication

Open Mathematics

ISSN

2391-5455

Abstract

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.

Indexing Information

HJRS - X Category, Scopus, Web of Science - Science Citation Index Expanded (SCI)

Journal Quality Ranking

Impact Factor: 0.726

Publication Status

Published

Share

COinS