Computing fault-tolerant metric dimension of graphs using their primary subgraphs
Fuente:
arXiv
Guardado en:
| Autores principales: | , , , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2025
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866917242932822016 |
|---|---|
| author | Prabhu, S. Klavžar, Sandi Dharan, K. Bharani Radha, S. |
| author_facet | Prabhu, S. Klavžar, Sandi Dharan, K. Bharani Radha, S. |
| contents | The metric dimension of a graph is the cardinality of a minimum resolving set, which is the set of vertices such that the distance representations of every vertex with respect to that set are unique. A fault-tolerant metric basis is a resolving set with a minimum cardinality that continues to resolve the graph even after the removal of any one of its vertices. The fault-tolerant metric dimension is the cardinality of such a fault-tolerant metric basis. In this article, we investigate the fault-tolerant metric dimension of graphs formed through the point-attaching process of primary subgraphs. This process involves connecting smaller subgraphs to specific vertices of a base graph, resulting in a more complex structure. By analyzing the distance properties and connectivity patterns, we establish explicit formulae for the fault-tolerant resolving sets of these composite graphs. Furthermore, we extend our results to specific graph products, such as rooted products. For these products, we determine the fault-tolerant metric dimension in terms of the fault-tolerant metric dimension of the primary subgraphs. Our findings demonstrate how the fault-tolerant dimension is influenced by the structural characteristics of the primary subgraphs and the attaching vertices. These results have potential applications in network design, error correction, and distributed systems, where robustness against vertex failures is crucial. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2509_14300 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Computing fault-tolerant metric dimension of graphs using their primary subgraphs Prabhu, S. Klavžar, Sandi Dharan, K. Bharani Radha, S. Combinatorics The metric dimension of a graph is the cardinality of a minimum resolving set, which is the set of vertices such that the distance representations of every vertex with respect to that set are unique. A fault-tolerant metric basis is a resolving set with a minimum cardinality that continues to resolve the graph even after the removal of any one of its vertices. The fault-tolerant metric dimension is the cardinality of such a fault-tolerant metric basis. In this article, we investigate the fault-tolerant metric dimension of graphs formed through the point-attaching process of primary subgraphs. This process involves connecting smaller subgraphs to specific vertices of a base graph, resulting in a more complex structure. By analyzing the distance properties and connectivity patterns, we establish explicit formulae for the fault-tolerant resolving sets of these composite graphs. Furthermore, we extend our results to specific graph products, such as rooted products. For these products, we determine the fault-tolerant metric dimension in terms of the fault-tolerant metric dimension of the primary subgraphs. Our findings demonstrate how the fault-tolerant dimension is influenced by the structural characteristics of the primary subgraphs and the attaching vertices. These results have potential applications in network design, error correction, and distributed systems, where robustness against vertex failures is crucial. |
| title | Computing fault-tolerant metric dimension of graphs using their primary subgraphs |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2509.14300 |