IDEAS home Printed from https://ideas.repec.org/a/plo/pone00/0313300.html
   My bibliography  Save this article

Fault-tolerant partition resolvability of cycle with chord

Author

Listed:
  • Kamran Azhar
  • Sohail Zafar
  • Asim Nadeem
  • Yilun Shang

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.

Suggested Citation

  • Kamran Azhar & Sohail Zafar & Asim Nadeem & Yilun Shang, 2024. "Fault-tolerant partition resolvability of cycle with chord," PLOS ONE, Public Library of Science, vol. 19(11), pages 1-11, November.
    • Handle: RePEc:plo:pone00:0313300
    DOI: 10.1371/journal.pone.0313300
    as

    Download full text from publisher

    File URL: https://journals.plos.org/plosone/article?id=10.1371/journal.pone.0313300
    Download Restriction: no
    File URL: https://journals.plos.org/plosone/article/file?id=10.1371/journal.pone.0313300&type=printable
    Download Restriction: no
    File URL: https://libkey.io/10.1371/journal.pone.0313300?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. Muhammad Azeem & Muhammad Kamran Jamil & Yilun Shang, 2023. "Notes on the Localization of Generalized Hexagonal Cellular Networks," Mathematics, MDPI, vol. 11(4), pages 1-15, February.
    2. Laxman Saha & Rupen Lama & Kalishankar Tiwary & Kinkar Chandra Das & Yilun Shang, 2022. "Fault-Tolerant Metric Dimension of Circulant Graphs," Mathematics, MDPI, vol. 10(1), pages 1-16, January.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Laxman Saha & Mithun Basak & Kalishankar Tiwary & Kinkar Chandra Das & Yilun Shang, 2022. "On the Characterization of a Minimal Resolving Set for Power of Paths," Mathematics, MDPI, vol. 10(14), pages 1-13, July.
    2. Muhammad Azeem & Muhammad Kamran Jamil & Yilun Shang, 2023. "Notes on the Localization of Generalized Hexagonal Cellular Networks," Mathematics, MDPI, vol. 11(4), pages 1-15, February.
    3. Laxman Saha & Bapan Das & Kalishankar Tiwary & Kinkar Chandra Das & Yilun Shang, 2023. "Optimal Multi-Level Fault-Tolerant Resolving Sets of Circulant Graph C ( n : 1, 2)," Mathematics, MDPI, vol. 11(8), pages 1-16, April.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:plo:pone00:0313300. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: plosone (email available below). General contact details of provider: https://journals.plos.org/plosone/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.