Monitoring edge-geodetic sets: hardness and graph products

DOI10.1016/J.DAM.2023.06.033MaRDI QIDQ6094715zbMATH OpenFDO

Authors John Haslegrave

Publication date 14 September 2023

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

Copyright license Creative Commons Attribution 4.0 International

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

zbMATH Keywords

Cartesian productcomputational complexityedge monitoringgeodetic problemshortest pathstrong product

Mathematics Subject Classification ID

Distance in graphs (05C12) Paths and cycles (05C38) Graph operations (line graphs, products, etc.) (05C76) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Abstract: Foucaud, Krishna and Lekshmi recently introduced the concept of monitoring edge-geodetic sets in graphs, and a related graph invariant. These are sets of vertices such that the removal of any edge changes the distance between some pair of vertices in the set. They studied the minimum possible size of such a set in a given graph, which we call the monitoring edge-geodetic number. We show that the decision problem for the monitoring edge-geodetic number is NP-complete. We also give best-possible upper and lower bounds for the Cartesian and strong products of two graphs. These bounds establish the exact value in many cases, including many new examples of graphs whose only monitoring edge-geodetic set is the whole vertex set.

Recommendations

• On The Edge Geodetic Number Of A Graph
• The edge geodetic number of product graphs
• The edge geodetic number and Cartesian product of graphs

Cites work

• Edge geodetic number of a graph
• Monitoring edge-geodetic sets in graphs
• Reducibility among combinatorial problems
• Strong edge geodetic problem in networks
• The geodetic number of a graph

Cited in

(15)

• On the parameterized complexity of the edge monitoring problem
• Monitoring the edges of a graph using distances with given girth
• Monitoring edge-geodetic sets in graphs: extremal graphs, bounds, complexity
• Fault-tolerance in distance-edge-monitoring sets
• Monitoring edge-geodetic sets in graphs
• Linear programming of monitoring the links of a fractional weighted network using distance
• Nordhaus-Gaddum-type results for monitoring edge-geodetic number of graphs
• Distance-based (and path-based) covering problems for graphs of given cyclomatic number
• Bounds and extremal graphs for monitoring edge-geodetic sets in graphs
• Monitoring arc-geodetic sets of oriented graphs
• Characterizing optimal monitoring edge-geodetic sets for some structured graph classes
• Algorithms and complexity for monitoring edge-geodetic sets in graphs
• Computing exact edge geodetic numbers in k-powered path and cycle graphs
• An algorithm for monitoring edge-geodetic sets in chordal graphs
• On the (in)approximability of the monitoring edge geodetic set problem

This page was built for publication: Monitoring edge-geodetic sets: hardness and graph products

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