On the distance-edge-monitoring numbers of graphs

DOI10.1016/j.dam.2023.09.012arXiv2211.04920MaRDI QIDQ6184320

Chenxu Yang, Yaping Mao, Ralf Klasing, Xing-Chao Deng

Publication date: 24 January 2024

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2211.04920

zbMATH Keywords

distancemetric dimensiondistance-edge-monitoring set

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• On the parameterized complexity of the edge monitoring problem
• Network verification via routing table queries
• The strong metric dimension of graphs and digraphs
• 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
• Exploring networks with traceroute-like probes: Theory and simulations
• Strong edge geodetic problem in networks
• On Metric Generators of Graphs
• Monitoring the edges of a graph using distances

This page was built for publication: On the distance-edge-monitoring numbers of graphs