Fault-Tolerant Metric Dimension in Carbon Networks
In this paper, we study the fault-tolerant metric dimension in graph theory, an important measure against failures in unique vertex identification. The metric dimension of a graph is the smallest number of vertices required to uniquely identify every other vertex based on their distances from these...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2025-04-01
|
| Series: | Foundations |
| Subjects: | |
| Online Access: | https://www.mdpi.com/2673-9321/5/2/13 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | In this paper, we study the fault-tolerant metric dimension in graph theory, an important measure against failures in unique vertex identification. The metric dimension of a graph is the smallest number of vertices required to uniquely identify every other vertex based on their distances from these chosen vertices. Building on existing work, we explore fault tolerance by considering the minimal number of vertices needed to ensure that all other vertices remain uniquely identifiable even if a specified number of these vertices fails. We compute the fault-tolerant metric dimension of various chemical graphs, namely fullerenes, benzene, and polyphenyl graphs. |
|---|---|
| ISSN: | 2673-9321 |