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

Metric dimensions of generalized Sierpiński graphs over squares

Author

Listed:
  • Prabhu, S.
  • Janany, T. Jenifer
  • Klavžar, Sandi

Abstract

Metric dimension is a valuable parameter that helps address problems related to network design, localization, and information retrieval by identifying the minimum number of landmarks required to uniquely determine distances between vertices in a graph. Generalized Sierpiński graphs represent a captivating class of fractal-inspired networks that have gained prominence in various scientific disciplines and practical applications. Their fractal nature has also found relevance in antenna design, image compression, and the study of porous materials. The hypercube is a prevalent interconnection network architecture known for its symmetry, vertex transitivity, regularity, recursive structure, high connectedness, and simple routing. Various variations of hypercubes have emerged in literature to meet the demands of practical applications. Sometimes, they are the spanning subgraphs of it. This study examines the generalized Sierpiński graphs over C4, which are spanning subgraphs of hypercubes and determines the metric dimension and their variants. This is in contrast to hypercubes, where these properties are inherently complicated. Along the way, the role of twin vertices in the theory of metric dimensions is further elaborated.

Suggested Citation

  • Prabhu, S. & Janany, T. Jenifer & Klavžar, Sandi, 2025. "Metric dimensions of generalized Sierpiński graphs over squares," Applied Mathematics and Computation, Elsevier, vol. 505(C).
    • Handle: RePEc:eee:apmaco:v:505:y:2025:i:c:s0096300325002541
    DOI: 10.1016/j.amc.2025.129528
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300325002541
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.amc.2025.129528?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.

    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:505:y:2025:i:c:s0096300325002541. 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.

    We have no bibliographic references for this item. You can help adding them by using 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.