3 citations · 3 across the 1 of their papers we have counts for
1 paper
Domingos M. Cardoso, Enide A. Martins, Luís Medina +1
A matching M is a dominating induced matching of a graph, if every edge of the graph is either in M or has a common end-vertex with exactly one edge in M. The concept of comple…