Fault-tolerant edge metric dimension of certain families of graphs
Let $W_E=\{w_1,w_2, \ldots,w_k\}$ be an ordered set of vertices of graph $G$ and let $e$ be an edge of $G$. Suppose $d(x,e)$ denotes distance between edge $e$ and vertex $x$ of $G$, defined as $d(e,x) = d(x,e) = \min \{d(x,a),d(x,b)\}$, where $e=ab$. A vertex $x$ distinguishes two edges $e_1$ and $e...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
AIMS Press
2021-11-01
|
| Series: | AIMS Mathematics |
| Subjects: | |
| Online Access: | https://www.aimspress.com/article/10.3934/math.2021069/fulltext.html |