3 papers
cs.DM2026
Zero Forcing Sets in Temporal Graphs
Julien Baste, Simon Dreyer, Clara Marcille +2
The Zero Forcing (or corruption) of a graph is the problem of finding a minimum-size ``corrupting'' set. It corresponds to a subset of its vertices that can corrupt the whole graph…
cs.DM2026
An Algorithm for Monitoring Edge-geodetic Sets in Chordal Graphs
Clara Marcille, Nacim Oijid
A monitoring edge-geodetic set (or meg-set for short) of a graph is a set of vertices such that if any edge is removed, then the distance between some two vertices of incre…
math.CO2025
Graph Irregularity via Edge Deletions
Julien Bensmail, Noémie Catherinot, Foivos Fioravantes +2
We pursue the study of edge-irregulators of graphs, which were recently introduced in [Fioravantes et al. Parametrised Distance to Local Irregularity. IPEC, 2024]. That is, we are…