Metric dimensions of generalized Sierpiński graphs over squares
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , , |
|---|---|
| Format: | Preprint |
| Publié: |
2024
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866914188181372928 |
|---|---|
| author | Prabhu, Savari Janany, T. Jenifer Klavžar, Sandi |
| author_facet | Prabhu, Savari Janany, T. Jenifer Klavžar, Sandi |
| contents | 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 $C_4$, 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2404_00771 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Metric dimensions of generalized Sierpiński graphs over squares Prabhu, Savari Janany, T. Jenifer Klavžar, Sandi Combinatorics 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 $C_4$, 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. |
| title | Metric dimensions of generalized Sierpiński graphs over squares |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2404.00771 |