Proves dem(G-e) - dem(G) ≤ 2 (sharp), shows arbitrary changes from vertex deletion, and gives an algorithm to verify monitoring-set persistence after edge removal.
Diameter vulnerability of graphs by edge deletion,Discrete Math
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DM 1years
2023 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Perturbation results for distance-edge-monitoring numbers
Proves dem(G-e) - dem(G) ≤ 2 (sharp), shows arbitrary changes from vertex deletion, and gives an algorithm to verify monitoring-set persistence after edge removal.