9 citations · 10 across the 7 of their papers we have counts for
4 papers · 1 filter
Algorithms and complexity for monitoring edge-geodetic sets in graphs
Florent Foucaud, Clara Marcille, R. B. Sandeep +2
A monitoring edge-geodetic set of a graph is a subset of its vertices such that for every edge in the graph, deleting increases the distance between at least one pair o…
Large planar -cliques
Susobhan Bandopadhyay, Sagnik Sen, S Taruni
An \textit{-graph} is a graph having both arcs and edges, and its arcs (resp., edges) are labeled using one of the (resp., ) different symbols. An \textit{…
Monitoring arc-geodetic sets of oriented graphs
Tapas Das, Florent Foucaud, Clara Marcille +2
Monitoring edge-geodetic sets in a graph are subsets of vertices such that every edge of the graph must lie on all the shortest paths between two vertices of the monitoring set. Th…
Bounds and extremal graphs for monitoring edge-geodetic sets in graphs
Florent Foucaud, Clara Marcille, Zin Mar Myint +3
A monitoring edge-geodetic set, or simply an MEG-set, of a graph is a vertex subset such that given any edge of , lies on every shortest - p…