Khalaf, A.J.M.Nadeem, M.F.Azeem, M.Farahani, M.R.Cancan, M.2025-05-102025-05-1020211817-34622-s2.0-85114340293https://hdl.handle.net/20.500.14720/310The distance of a connected, simple graph (Formula presented) is denoted by d(α1, α2), which is the length of a shortest path between the vertices α1,α2 (Formula presented) V((Formula presented)), where V((Formula presented)) is the vertex set of (Formula presented). The l-ordered partition of V((Formula presented)) is K = {K1, K2,..., Kl}. A vertex α (Formula presented) V((Formula presented)), and r(α|K) = {d(α, K1), d(α, K2),..., d(α, Kl)} be a l-tuple distances, where r(α|K) is the representation of a vertex a with respect to set K. If r(a|K) of a is unique, for every pair of vertices, then K is the resolving partition set of V((Formula presented)). The minimum number l in the resolving partition set K is known as partition dimension (pd(P)). In this paper, we studied the generalized families of Peterson graph, Pλx and proved that these families have bounded partition dimension. © 2021. All Rights Reserved.eninfo:eu-repo/semantics/closedAccessGeneralized Peterson GraphHarary GraphPartition DimensionPartition Resolving SetSharp Bounds Of Partition DimensionArticle171N/AQ28494