Complexity of Dominating Induced Matching and Perfect Edge Domination Problems for Neighborhood Star-Free Graphs

The paper studies the complexity of the dominating induced matching (DIM) problem and the perfect edge domination (PED) problem for neighborhood star-free (NSF) graphs. It proves that the corresponding decision problems are NP-Complete for several subclasses of NSF graphs.