IDEAS home Printed from https://ideas.repec.org/a/eee/apmaco/v420y2022ics0096300321009802.html
   My bibliography  Save this article

Twin vertices in fault-tolerant metric sets and fault-tolerant metric dimension of multistage interconnection networks

Author

Listed:
  • Prabhu, S.
  • Manimozhi, V.
  • Arulperumjothi, M.
  • Klavžar, Sandi

Abstract

A set of vertices S⊆V(G) is a resolving set of a graph G if for each x,y∈V(G) there is a vertex u∈S such that d(x,u)≠d(y,u). A resolving set S is a fault-tolerant resolving set if S∖{x} is a resolving set for every x∈S. The fault-tolerant metric dimension (FTMD) β′(G) of G is the minimum cardinality of a fault-tolerant resolving set. It is shown that each twin vertex of G belongs to every fault-tolerant resolving set of G. As a consequence, β′(G)=n(G) iff each vertex of G is a twin vertex, which corrects a wrong characterization of graphs G with β′(G)=n(G) from [Mathematics 7(1) (2019) 78]. This FTMD problem is reinvestigated for Butterfly networks, Benes networks, and silicate networks. This extends partial results from [IEEE Access 8 (2020) 145435–145445], and at the same time, disproves related conjectures from the same paper.

Suggested Citation

  • Prabhu, S. & Manimozhi, V. & Arulperumjothi, M. & Klavžar, Sandi, 2022. "Twin vertices in fault-tolerant metric sets and fault-tolerant metric dimension of multistage interconnection networks," Applied Mathematics and Computation, Elsevier, vol. 420(C).
  • Handle: RePEc:eee:apmaco:v:420:y:2022:i:c:s0096300321009802
    DOI: 10.1016/j.amc.2021.126897
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300321009802
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.amc.2021.126897?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Hassan Raza & Sakander Hayat & Muhammad Imran & Xiang-Feng Pan, 2019. "Fault-Tolerant Resolvability and Extremal Structures of Graphs," Mathematics, MDPI, vol. 7(1), pages 1-19, January.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Arulperumjothi, M. & Klavžar, Sandi & Prabhu, S., 2023. "Redefining fractal cubic networks and determining their metric dimension and fault-tolerant metric dimension," Applied Mathematics and Computation, Elsevier, vol. 452(C).

    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. Sakander Hayat & Asad Khan & Yubin Zhong, 2022. "On Resolvability- and Domination-Related Parameters of Complete Multipartite Graphs," Mathematics, MDPI, vol. 10(11), pages 1-16, May.
    2. Juan Wang & Lianying Miao & Yunlong Liu, 2019. "Characterization of n -Vertex Graphs of Metric Dimension n − 3 by Metric Matrix," Mathematics, MDPI, vol. 7(5), pages 1-13, May.

    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:eee:apmaco:v:420:y:2022:i:c:s0096300321009802. 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: Catherine Liu (email available below). General contact details of provider: https://www.journals.elsevier.com/applied-mathematics-and-computation .

    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.