Fault-tolerant partition resolvability of cycle with chord

Kamran Azhar, Sohail Zafar, Asim Nadeem and Yilun Shang

PLOS ONE, 2024, vol. 19, issue 11, 1-11

Abstract: In the realm of connected networks, distance-based parameters, particularly the partition dimension of graphs, have extensive applications across various fields, including chemistry and computer science. A notable variant of the partition dimension is the fault-tolerant resolving partition, which is critical in computer science for networking, optimization, and navigation tasks. In networking, fault-tolerant partitioning ensures robust communication pathways even in the event of network failures or disruptions. In optimization, it aids in developing efficient algorithms capable of withstanding errors or changes in input data. In navigation systems, fault-tolerant partitioning supports reliable route planning and navigation services under uncertain or dynamic conditions. This paper focuses on the fault-tolerant partition dimension within the specific context of the cycle with chord graphs, exploring its properties and implications for enhancing the robustness and reliability of networked systems.

Date: 2024
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
https://journals.plos.org/plosone/article?id=10.1371/journal.pone.0313300 (text/html)
https://journals.plos.org/plosone/article/file?id= ... 13300&type=printable (application/pdf)

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:plo:pone00:0313300

DOI: 10.1371/journal.pone.0313300

Access Statistics for this article

More articles in PLOS ONE from Public Library of Science
Bibliographic data for series maintained by plosone ().