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

On the fault-tolerant metric dimension of convex polytopes

Author

Listed:
  • Raza, Hassan
  • Hayat, Sakander
  • Pan, Xiang-Feng

Abstract

A convex polytopes is a polytope that is also a convex set of points in the n-dimensional Euclidean space Rn. By preserving the same adjacency relation between vertices of a convex polytope, its graph is constructed. The metric dimension problem has been extensively studied for convex polytopes and other families of graphs. In this paper, we study the fault-tolerant metric dimension problem for convex polytopes. By using a relation between resolving sets and fault-tolerant resolving sets of graphs, we prove that certain infinite families of convex polytopes are the families of graphs with constant fault-tolerant metric dimension. We conclude the paper with some open problems.

Suggested Citation

  • Raza, Hassan & Hayat, Sakander & Pan, Xiang-Feng, 2018. "On the fault-tolerant metric dimension of convex polytopes," Applied Mathematics and Computation, Elsevier, vol. 339(C), pages 172-185.
  • Handle: RePEc:eee:apmaco:v:339:y:2018:i:c:p:172-185
    DOI: 10.1016/j.amc.2018.07.010
    as

    Download full text from publisher

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

    File URL: https://libkey.io/10.1016/j.amc.2018.07.010?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. Gao, Wei & Farahani, Mohammad Reza & Wang, Shaohui & Husin, Mohamad Nazri, 2017. "On the edge-version atom-bond connectivity and geometric arithmetic indices of certain graph operations," Applied Mathematics and Computation, Elsevier, vol. 308(C), pages 11-17.
    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).
    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. 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.
    4. 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.
    5. Hassan Raza, 2021. "Computing Open Locating-Dominating Number of Some Rotationally-Symmetric Graphs," Mathematics, MDPI, vol. 9(12), pages 1-12, June.

    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. Lin, Wenshui & Chen, Jianfeng & Wu, Zhixi & Dimitrov, Darko & Huang, Linshan, 2018. "Computer search for large trees with minimal ABC index," Applied Mathematics and Computation, Elsevier, vol. 338(C), pages 221-230.
    2. Shao, Zehui & Wu, Pu & Gao, Yingying & Gutman, Ivan & Zhang, Xiujun, 2017. "On the maximum ABC index of graphs without pendent vertices," Applied Mathematics and Computation, Elsevier, vol. 315(C), pages 298-312.
    3. Shaohui Wang & Chunxiang Wang & Lin Chen & Jia-Bao Liu & Zehui Shao, 2018. "Maximizing and Minimizing Multiplicative Zagreb Indices of Graphs Subject to Given Number of Cut Edges," Mathematics, MDPI, vol. 6(11), pages 1-10, October.

    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:339:y:2018:i:c:p:172-185. 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.