Erdös-Gallai-type problems for distance-edge-monitoring numbers

DOI10.1016/j.dam.2023.09.020OpenAlexW4387511759MaRDI QIDQ6184335

No author found.

Publication date: 24 January 2024

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

Full work available at URL: https://doi.org/10.1016/j.dam.2023.09.020

zbMATH Keywords

distancehexagonal networkdistance-edge-monitoring numberradix \(n\)-triangular mesh network

Mathematics Subject Classification ID

Applications of graph theory (05C90) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Graph theory (including graph drawing) in computer science (68R10) Distance in graphs (05C12)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Erdős-Gallai-type results for colorful monochromatic connectivity of a graph
• Network verification via routing table queries
• On minimum metric dimension of honeycomb networks
• 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
• Mixed metric dimension of graphs
• Monochromatic disconnection: Erdős-Gallai-type problems and product graphs
• An analogue of the Erdős-Gallai theorem for random graphs
• Erdős-Gallai-type results for total monochromatic connection of graphs
• Exploring networks with traceroute-like probes: Theory and simulations
• Monitoring the edges of a graph using distances