Monitoring the edges of a graph using distances with given girth
From MaRDI portal
Cites work
- Congruent Graphs and the Connectivity of Graphs
- Discovery of network properties with all-shortest-paths queries
- Domination in graphs with minimum degree two
- Exploring networks with traceroute-like probes: Theory and simulations
- Extremal graph theory for metric dimension and diameter
- scientific article; zbMATH DE number 3544092 (Why is no real title available?)
- scientific article; zbMATH DE number 3221976 (Why is no real title available?)
- Landmarks in graphs
- Local metric dimension for graphs with small clique numbers
- Mixed metric dimension of graphs
- Mixed metric dimension of some graphs
- Monitoring edge-geodetic sets: hardness and graph products
- Network verification via routing table queries
- The local metric dimension of a graph
- The metric dimension and girth of graphs
- Uniquely identifying the edges of a graph: the edge metric dimension
- Über ein Problem von K. Zarankiewicz
Cited in
(8)- Monitoring the edges of product networks using distances
- Fault-tolerance in distance-edge-monitoring sets
- On the vertices belonging to all edge metric bases
- 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
- The distance-edge-monitoring numbers of subdivision graphs
- Distance-based (and path-based) covering problems for graphs of given cyclomatic number
This page was built for publication: Monitoring the edges of a graph using distances with given girth
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6126478)
