On bounded partition dimension of different families of convex polytopes with pendant edges

Let ψ=(V,E) be a simple connected graph. The distance between ρ1,ρ2∈V(ψ) is the length of a shortest path between ρ1 and ρ2. Let Γ={Γ1,Γ2,…,Γj} be an ordered partition of the vertices of ψ . Let ρ1∈V(ψ) , and r(ρ1|Γ)={d(ρ1,Γ1),d(ρ1,Γ2),…,d(ρ1,Γj)} be a j -tuple. If the representation...

Full description

Bibliographic Details
Main Authors: Khali, Adnan, Said Husain, Sh. K, Nadeem, Muhammad Faisal
Format: Article
Published: AIMS Press 2021
Online Access:http://psasir.upm.edu.my/id/eprint/94422/
_version_ 1848861992655257600
author Khali, Adnan
Said Husain, Sh. K
Nadeem, Muhammad Faisal
author_facet Khali, Adnan
Said Husain, Sh. K
Nadeem, Muhammad Faisal
author_sort Khali, Adnan
building UPM Institutional Repository
collection Online Access
description Let ψ=(V,E) be a simple connected graph. The distance between ρ1,ρ2∈V(ψ) is the length of a shortest path between ρ1 and ρ2. Let Γ={Γ1,Γ2,…,Γj} be an ordered partition of the vertices of ψ . Let ρ1∈V(ψ) , and r(ρ1|Γ)={d(ρ1,Γ1),d(ρ1,Γ2),…,d(ρ1,Γj)} be a j -tuple. If the representation r(ρ1|Γ) of every ρ1∈V(ψ) w.r.t. Γ is unique then Γ is the resolving partition set of vertices of ψ . The minimum value of j in the resolving partition set is known as partition dimension and written as pd(ψ). The problem of computing exact and constant values of partition dimension is hard so one can compute bound for the partition dimension of a general family of graph. In this paper, we studied partition dimension of the some families of convex polytopes with pendant edge such as RPn , Dpn and Qpn and proved that these graphs have bounded partition dimension.
first_indexed 2025-11-15T13:09:56Z
format Article
id upm-94422
institution Universiti Putra Malaysia
institution_category Local University
last_indexed 2025-11-15T13:09:56Z
publishDate 2021
publisher AIMS Press
recordtype eprints
repository_type Digital Repository
spelling upm-944222023-03-29T08:03:06Z http://psasir.upm.edu.my/id/eprint/94422/ On bounded partition dimension of different families of convex polytopes with pendant edges Khali, Adnan Said Husain, Sh. K Nadeem, Muhammad Faisal Let ψ=(V,E) be a simple connected graph. The distance between ρ1,ρ2∈V(ψ) is the length of a shortest path between ρ1 and ρ2. Let Γ={Γ1,Γ2,…,Γj} be an ordered partition of the vertices of ψ . Let ρ1∈V(ψ) , and r(ρ1|Γ)={d(ρ1,Γ1),d(ρ1,Γ2),…,d(ρ1,Γj)} be a j -tuple. If the representation r(ρ1|Γ) of every ρ1∈V(ψ) w.r.t. Γ is unique then Γ is the resolving partition set of vertices of ψ . The minimum value of j in the resolving partition set is known as partition dimension and written as pd(ψ). The problem of computing exact and constant values of partition dimension is hard so one can compute bound for the partition dimension of a general family of graph. In this paper, we studied partition dimension of the some families of convex polytopes with pendant edge such as RPn , Dpn and Qpn and proved that these graphs have bounded partition dimension. AIMS Press 2021-12-21 Article PeerReviewed Khali, Adnan and Said Husain, Sh. K and Nadeem, Muhammad Faisal (2021) On bounded partition dimension of different families of convex polytopes with pendant edges. AIMS Mathematics, 7 (3). pp. 4405-4415. ISSN 2473-6988 https://www.aimspress.com/article/doi/10.3934/math.2022245 10.3934/math.2022245
spellingShingle Khali, Adnan
Said Husain, Sh. K
Nadeem, Muhammad Faisal
On bounded partition dimension of different families of convex polytopes with pendant edges
title On bounded partition dimension of different families of convex polytopes with pendant edges
title_full On bounded partition dimension of different families of convex polytopes with pendant edges
title_fullStr On bounded partition dimension of different families of convex polytopes with pendant edges
title_full_unstemmed On bounded partition dimension of different families of convex polytopes with pendant edges
title_short On bounded partition dimension of different families of convex polytopes with pendant edges
title_sort on bounded partition dimension of different families of convex polytopes with pendant edges
url http://psasir.upm.edu.my/id/eprint/94422/
http://psasir.upm.edu.my/id/eprint/94422/
http://psasir.upm.edu.my/id/eprint/94422/