Perturbation results for distance-edge-monitoring numbers

DOI10.3233/FI-242176MaRDI QIDQ6593703zbMATH OpenFDO

Authors Chenxu Yang, Ralf Klasing, Changxiang He, Yaping Mao

Publication date 27 August 2024

Published in Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3233/FI-242176

zbMATH Keywords

distancedistance-edge-monitoring setperturbation result

Mathematics Subject Classification ID

Distance in graphs (05C12) Metric theory (11J83) Geometric theory, characteristics, transformations in context of PDEs (35A30) General theory of distance geometry (51K05) Computer science (68-XX)

Cites work

• Diameter vulnerability of graphs by edge deletion
• Discovery of network properties with all-shortest-paths queries
• Erdös-Gallai-type problems for distance-edge-monitoring numbers
• Exploring networks with traceroute-like probes: Theory and simulations
• scientific article; zbMATH DE number 2068163 (Why is no real title available?)
• scientific article; zbMATH DE number 894696 (Why is no real title available?)
• Network verification via routing table queries
• On the distance-edge-monitoring numbers of graphs
• On the parameterized complexity of the edge monitoring problem
• The effect of vertex and edge deletion on the edge metric dimension of graphs
• The effect of vertex or edge deletion on the metric dimension of graphs

Cited in

(5)

• Monitoring the edges of product networks using distances
• Fault-tolerance in distance-edge-monitoring sets
• The local metric dimension and distance-edge-monitoring number of graph
• Linear programming of monitoring the links of a fractional weighted network using distance
• Nordhaus-Gaddum-type results for monitoring edge-geodetic number of graphs

This page was built for publication: Perturbation results for distance-edge-monitoring numbers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6593703)