Monitoring edge-geodetic sets: hardness and graph products

DOI10.1016/j.dam.2023.06.033zbMath1521.05190arXiv2210.08955MaRDI QIDQ6094715

John Haslegrave

Publication date: 14 September 2023

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

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

zbMATH Keywords

computational complexityshortest pathCartesian productstrong productedge monitoringgeodetic problem

Mathematics Subject Classification ID

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

Related Items (1)

Monitoring the edges of a graph using distances with given girth

Cites Work

• The geodetic number of a graph
• Strong edge geodetic problem in networks
• Reducibility among Combinatorial Problems
• Edge geodetic number of a graph
• Monitoring the edges of a graph using distances
• Monitoring edge-geodetic sets in graphs

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