Fault-tolerance in distance-edge-monitoring sets
From MaRDI portal
Publication:6668144
DOI10.1007/S00236-024-00476-6MaRDI QIDQ6668144FDOQ6668144
Yaping Mao, XiaoYan Zhang, Gang Yang, Chenxu Yang, Yuzhi Xiao, Ralf Klasing
Publication date: 21 January 2025
Published in: Acta Informatica (Search for Journal in Brave)
Graph theory (including graph drawing) in computer science (68R10) Reliability, testing and fault tolerance of networks and computer systems (68M15)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Extremal graph theory for metric dimension and diameter
- The geodetic number of a graph
- Graphs with prescribed connectivity and line graph connectivity
- On the fault-tolerant metric dimension of convex polytopes
- Fault-tolerant metric dimension of circulant graphs \(C_n(1,2,3)\)
- Monitoring the edges of a graph using distances
- Monitoring edge-geodetic sets: hardness and graph products
- Monitoring the edges of a graph using distances with given girth
- On the distance-edge-monitoring numbers of graphs
- Distance-edge-monitoring sets of networks
- Monitoring edge-geodetic sets in graphs: extremal graphs, bounds, complexity
- Perturbation results for distance-edge-monitoring numbers
This page was built for publication: Fault-tolerance in distance-edge-monitoring sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6668144)
