Monitoring edge-geodetic sets in graphs

DOI10.1007/978-3-031-25211-2_19arXiv2210.03774MaRDI QIDQ6132539

Florent Foucaud, Lekshmi Ramasubramony Sulochana, Krishna R. Narayanan

Publication date: 17 August 2023

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

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

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Related Items

Monitoring edge-geodetic sets: hardness and graph products

Cites Work

• Unnamed Item
• The (weighted) metric dimension of graphs: hard and easy cases
• The complexity ecology of parameters: An illustration using bounded max leaf number
• Network verification via routing table queries
• The geodetic number of a graph
• Strong edge geodetic problem in networks
• Metric Dimension Parameterized by Max Leaf Number
• Parameterized Complexity of Geodetic Set
• Edge geodetic number of a graph
• Monitoring the edges of a graph using distances