Realizability problem of distance-edge-monitoring numbers
From MaRDI portal
Publication:6658853
DOI10.1051/ro/2024106MaRDI QIDQ6658853
Eddie Cheng, Yaping Mao, Zhen Ji, Xiaoyan Zhang
Publication date: 8 January 2025
Published in: RAIRO. Operations Research (Search for Journal in Brave)
Trees (05C05) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Paths and cycles (05C38) Distance in graphs (05C12) Graph operations (line graphs, products, etc.) (05C76)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Deterministic small-world communication networks
- Network verification via routing table queries
- Discovery of network properties with all-shortest-paths queries
- Topologies and Laplacian spectra of a deterministic uniform recursive tree
- Reducing complexity in tree-like computer interconnection networks
- Renormalization group analysis of the small-world network model
- Uniquely identifying the edges of a graph: the edge metric dimension
- A result on the 3-generalized connectivity of a graph and its line graph
- Mixed metric dimension of graphs
- Exploring networks with traceroute-like probes: Theory and simulations
- The connectivity of line-graphs
- A small-world network derived from the deterministic uniform recursive tree by line graph operation
- Graphs with prescribed connectivity and line graph connectivity
- Monitoring the edges of a graph using distances
- New results and open problems in line graphs
- On the distance-edge-monitoring numbers of graphs
- Erdös-Gallai-type problems for distance-edge-monitoring numbers
- Distance-edge-monitoring sets of networks
Related Items (1)
This page was built for publication: Realizability problem of distance-edge-monitoring numbers
