Fault Tolerant Partition Resolvability in Convex Polytopes

Asim Nadeem, Agha Kashif, Ebenezer Bonyah, Sohail Zafar and Yong Aaron Tan

Mathematical Problems in Engineering, 2022, vol. 2022, 1-12

Abstract: Convex polytopes are special types of polytopes having an additional property that they are also convex sets in the n-dimensional Euclidean space. The convex polytope topologies are being used in the antitracking networks due to their stability, resilience, and destroy-resistance. The metric related parameters have been extensively studied in the recent times due to their applications in several areas including robot navigation, network designing, image processing, and chemistry. In this article, the sharp bounds for the fault tolerant partition dimension of certain well-known families of convex polytopes Rn, Qn, Sn, Tn, and Dn have been computed. Furthermore, we have studied the graphs having fault tolerant partition dimension bounded below by 4.

Date: 2022
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/mpe/2022/3238293.pdf (application/pdf)
http://downloads.hindawi.com/journals/mpe/2022/3238293.xml (application/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jnlmpe:3238293

DOI: 10.1155/2022/3238293

Access Statistics for this article

More articles in Mathematical Problems in Engineering from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().