An algorithm for monitoring edge-geodetic sets in chordal graphs

DOI10.1007/978-3-032-27732-9_31MaRDI QIDQ7363404zbMATH OpenFDO

Authors Clara Marcille, Nacim Oijid

Publication date 29 September 2026

Full work available at URL https://doi.org/10.1007/978-3-032-27732-9_31

Mathematics Subject Classification ID

Discrete mathematics in relation to computer science (68Rxx) Algorithms in computer science (68Wxx)

Cites work

• Bounds and extremal graphs for monitoring edge-geodetic sets in graphs
• Characterizing optimal monitoring edge-geodetic sets for some structured graph classes
• Monitoring edge-geodetic sets in graphs
• Monitoring edge-geodetic sets: hardness and graph products
• Monitoring the edges of a graph using distances
• Network verification via routing table queries

This page was built for publication: An algorithm for monitoring edge-geodetic sets in chordal graphs

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