Monitoring the edges of a graph using distances
Résumé
We introduce a new graph-theoretic concept in the area of network monitoring. A set M of vertices of a graph G is a distance-edgemonitoring set if for every edge e of G, there is a vertex x of M and a
| Origine | Fichiers produits par l'(les) auteur(s) |
|---|