The Application of Fault-Tolerant Partition Resolvability in Cycle-Related Graphs

摘要

The concept of metric-related parameters permeates all of graph theory and plays an important role in diverse networks, such as social networks, computer networks, biological networks and neural networks. The graph parameters include an incredible tool for analyzing the abstract structures of networks. An important metric-related parameter is the partition dimension of a graph holding auspicious applications in telecommunication, robot navigation and geographical routing protocols. A fault-tolerant resolving partition is a preference for the concept of a partition dimension. A system is fault-tolerant if failure of any single unit in the originally used chain is replaced by another chain of units not containing the faulty unit. Due to the optimal fault tolerance, cycle-related graphs have applications in network analysis, periodic scheduling and surface reconstruction. In this paper, it is shown that the partition dimension (PD) and fault-tolerant partition dimension (FTPD) of cycle-related graphs, including kayak paddle and flower graphs, are constant and free from the order of these graphs. More explicitly, the FTPD of kayak paddle and flower graphs is four, whereas the PD of flower graphs is three. Finally, an application of these parameters in a scenario of installing water reservoirs in a locality has also been furnished in order to verify our findings.