Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2410.08662 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866910645355544576 |
|---|---|
| author | Prabhu, S. Jeba, D. Sagaya Rani Manuel, Paul Davoodi, Akbar |
| author_facet | Prabhu, S. Jeba, D. Sagaya Rani Manuel, Paul Davoodi, Akbar |
| contents | The metric dimension of a graph measures how uniquely vertices may be identified using a set of landmark vertices. This concept is frequently used in the study of network architecture, location-based problems and communication. Given a graph $G$, the metric dimension, denoted as $\dim(G)$, is the minimum size of a resolving set, a subset of vertices such that for every pair of vertices in $G$, there exists a vertex in the resolving set whose shortest path distance to the two vertices is different. This subset of vertices helps to uniquely determine the location of other vertices in the graph. A basis is a resolving set with a least cardinality. Finding a basis is a problem with practical applications in network design, where it is important to efficiently locate and identify nodes based on a limited set of reference points. The Cartesian product of $P_m$ and $P_n$ is the grid network in network science. In this paper, we investigate two novel types of grids in network science: the Villarceau grid Type I and Type II. For each of these grid types, we find the precise metric dimension. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2410_08662 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Metric Dimension of Villarceau Grids Prabhu, S. Jeba, D. Sagaya Rani Manuel, Paul Davoodi, Akbar Combinatorics 05C12 The metric dimension of a graph measures how uniquely vertices may be identified using a set of landmark vertices. This concept is frequently used in the study of network architecture, location-based problems and communication. Given a graph $G$, the metric dimension, denoted as $\dim(G)$, is the minimum size of a resolving set, a subset of vertices such that for every pair of vertices in $G$, there exists a vertex in the resolving set whose shortest path distance to the two vertices is different. This subset of vertices helps to uniquely determine the location of other vertices in the graph. A basis is a resolving set with a least cardinality. Finding a basis is a problem with practical applications in network design, where it is important to efficiently locate and identify nodes based on a limited set of reference points. The Cartesian product of $P_m$ and $P_n$ is the grid network in network science. In this paper, we investigate two novel types of grids in network science: the Villarceau grid Type I and Type II. For each of these grid types, we find the precise metric dimension. |
| title | Metric Dimension of Villarceau Grids |
| topic | Combinatorics 05C12 |
| url | https://arxiv.org/abs/2410.08662 |