Showing cs.DMShow all
2 papers · 1 filter
cs.DM2018
Eternal dominating sets on digraphs and orientations of graphs
Guillaume Bagan, Alice Joffard, Hamamache Kheddouci
We study the eternal dominating number and the m-eternal dominating number on digraphs. We generalize known results on graphs to digraphs. We also consider the problem "oriented (m…
cs.DM2017
Complexity of Edge Monitoring on Some Graph Classes
Guillaume Bagan, Fairouz Beggas, Mohammed Haddad +1
In this paper, we study the complexity of the edge monitoring problem. A vertex monitors an edge if both extremities together with form a triangle in the graph. Given a…