Optimal Fault-Tolerant Resolving Set of Power Paths
In a simple connected undirected graph <i>G</i>, an ordered set <i>R</i> of vertices is called a resolving set if for every pair of distinct vertices <i>u</i> and <i>v</i>, there is a vertex <inline-formula><math xmlns="http://www.w3.org/...
| Main Authors: | , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2023-06-01
|
| Series: | Mathematics |
| Subjects: | |
| Online Access: | https://www.mdpi.com/2227-7390/11/13/2868 |