Monitoring the edges of product networks using distances

DOI10.1016/J.JCSS.2024.103602MaRDI QIDQ6655674

W. Li, Bo Ning, Yaping Mao, Ralf Klasing

Publication date: 27 December 2024

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

zbMATH Keywords

networksdistancejoinCartesian productdistance-edge-monitoring set

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Distance in graphs (05C12)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the strong metric dimension of Cartesian and direct products of graphs
• Network verification via routing table queries
• On a theorem of Rademacher-Turán
• Discovery of network properties with all-shortest-paths queries
• Uniquely identifying the edges of a graph: the edge metric dimension
• Matching preclusion number of graphs
• Edge metric dimension of some graph operations
• Exploring networks with traceroute-like probes: Theory and simulations
• On the Metric Dimension of Cartesian Products of Graphs
• Monitoring the edges of a graph using distances
• Monitoring the edges of a graph using distances with given girth
• On the distance-edge-monitoring numbers of graphs
• Erdös-Gallai-type problems for distance-edge-monitoring numbers
• Distance-edge-monitoring sets of networks
• Perturbation results for distance-edge-monitoring numbers
• Realizability problem of distance-edge-monitoring numbers

This page was built for publication: Monitoring the edges of product networks using distances

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