Showing cs.DMShow all
2 papers · 1 filter
cs.DM2019
[1,2]-Domination in Generalized Petersen Graphs
Fairouz Beggas, Volker Turau, Mohammed Haddad +1
A vertex subset of a graph is a -dominating set if each vertex of is adjacent to either one or two vertices in . The minimum cardinality of…
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…