Perfect Edge Domination in $P_6$-free Graphs and in Graphs Without Efficient Edge Dominating Sets

Abstract

An edge of a graph dominates itself along with any edge that shares an endpoint with it. An efficient edge dominating set (also called a dominating induced matching, DIM) is a subset of edges such that each edge of the graph is dominated by exactly one edge in the subset. A perfect edge dominating set is a subset of edges in which every edge outside the subset is dominated by exactly one edge within it. In this article, we establish the NP-completeness of deciding whether a graph that does not admit any efficient edge dominating set has at least two perfect edge dominating sets. We also present a cubic time algorithm designed to identify a perfect dominating set of minimal cardinality for $P_6$-free graphs. Moreover, we show how this algorithm can be adapted to handle the weighted version of the problem and to count all perfect edge dominating sets as well as DIMs in a given graph, while preserving the same time complexity.