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

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/

Similar Items

Similar Items