Monitoring the edges of a graph using distances with given girth
From MaRDI portal
Publication:6126478
DOI10.1016/J.JCSS.2024.103528MaRDI QIDQ6126478
No author found.
Publication date: 9 April 2024
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Network verification via routing table queries
- Discovery of network properties with all-shortest-paths queries
- Uniquely identifying the edges of a graph: the edge metric dimension
- Mixed metric dimension of graphs
- Local metric dimension for graphs with small clique numbers
- Exploring networks with traceroute-like probes: Theory and simulations
- Extremal graph theory for metric dimension and diameter
- The metric dimension and girth of graphs
- Landmarks in graphs
- Mixed metric dimension of some graphs
- Über ein Problem von K. Zarankiewicz
- Domination in graphs with minimum degree two
- Congruent Graphs and the Connectivity of Graphs
- Monitoring the edges of a graph using distances
- Monitoring edge-geodetic sets: hardness and graph products
Related Items (2)
Monitoring the edges of product networks using distances ⋮ Fault-tolerance in distance-edge-monitoring sets
This page was built for publication: Monitoring the edges of a graph using distances with given girth
