Key points are not available for this paper at this time.
The fractional versions of various metric related parameters have recently gained importance due to their applications in the fields of sensor networking, robot navigation and linear optimization problems. Convex polytopes are collection of those polytopes of Euclidean space which are their convex subsets. They have key importance in the field of network designing due to their stable and resilient structure which aids optimal data transfer. The identification and removal of components (nodes) of a communication network causing abruption in its flow is of key importance for optimal data transmission. These components are referred as strong resolving neighbourhood (SRNs) in graph theory and assigning least weight to these components aids the computation of fractional strong metric dimension (FSMD). In this paper, we compute FSMD for certain convex polytopes which include P₍, P₍^1 and P₍^2. In this regard, it is shown that for n 3, FSMD of P₍ and P₍^2 is n and 3n2, respectively. Also, FSMD of P₍^1 is n when n is odd and 3n2 when n is even. Finally, an application of FSMD in the context of internet connection networks is furnished.
Jamil et al. (2024) studied this question.