Monitoring arc-geodetic sets of oriented graphs

DOI10.1016/J.TCS.2025.115079MaRDI QIDQ7026227zbMATH OpenFDO

Authors Tapas K. Das, Florent Foucaud, Clara Marcille, Sagnik Sen

Publication date 18 February 2025

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.TCS.2025.115079

zbMATH Keywords

geodetic setoriented graphmonitoring edge-geodetic set

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cites work

• Geodetic spectra of graphs.
• Hull and geodetic numbers for some classes of oriented graphs
• Monitoring edge-geodetic sets in graphs
• Monitoring edge-geodetic sets in graphs: extremal graphs, bounds, complexity
• Monitoring edge-geodetic sets: hardness and graph products
• Monitoring the edges of a graph using distances
• Network verification via routing table queries
• Orientable convexity, geodetic and hull numbers in graphs
• The geodetic number of a graph
• The geodetic number of an oriented graph
• The geodetic numbers of graphs and digraphs
• The hull and geodetic numbers of orientations of graphs
• The nature of computation
• The upper and lower geodetic numbers of graphs.

This page was built for publication: Monitoring arc-geodetic sets of oriented graphs

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