---
title: Perfect Edge Dominating Set
url: https://www.emergentmind.com/topics/perfect-edge-dominating-set
type: topic
---

# Perfect Edge Dominating Set

A **perfect edge dominating set** of a graph \(G\) is a set \(P\subseteq E(G)\) such that every edge in \(E(G)\setminus P\) is dominated by **exactly one** edge of \(P\), where an edge dominates itself and every adjacent edge. Equivalently, each edge outside \(P\) has a unique neighbor in \(P\) in the line graph [2607.03894]. Perfect edge domination lies between ordinary edge domination and efficient edge domination: an **edge dominating set** only requires domination by at least one selected edge, whereas an **efficient edge dominating set**—also called a **dominating induced matching** (DIM)—requires that every edge of the graph be dominated by exactly one selected edge and that the selected edges be pairwise non-adjacent [1705.08379, 2509.04598]. The subject combines structural graph theory, hardness reductions, hereditary-class dichotomies, and exact algorithms, with particularly strong results on \(P_5\)-free graphs, \(P_6\)-free graphs, circular-arc graphs, generalized series-parallel graphs, and chordal graphs [1705.08379, 2509.04598, 1502.01523, 2607.03894].

## 1. Definitions and basic variants

For an undirected graph \(G\), an edge \(e\) dominates itself and every edge adjacent to it. A set \(E'\subseteq E(G)\) is an **edge dominating set** if every edge of \(G\) is dominated by some edge in \(E'\). It is a **perfect edge dominating set** if every edge in \(E(G)\setminus E'\) is dominated by **exactly one** edge of \(E'\) [1705.08379]. The corresponding decision problem is:

- **PERFECT EDGE DOMINATION**  
  **INPUT:** Graph \(G\), integer \(p\)  
  **QUESTION:** Does \(G\) contain a perfect edge dominating set \(S\) of size \(\le p\)? [1705.08379]

The optimization version asks for a least-cardinality perfect edge dominating set. The weighted version asks for a minimum-weight perfect edge dominating set, where edge weights may be arbitrary reals, even negative [1705.08379].

Two special subclasses are standard. A **trivial** perfect edge dominating set is \(P=E(G)\), equivalently \(W=\emptyset\) in the coloring formalism below. A **proper** perfect edge dominating set is one that is neither trivial nor a DIM; for connected graphs with at least three vertices, this is the case \(B\neq\emptyset\), \(Y\neq\emptyset\), and \(W\neq\emptyset\) [1705.08379, 2509.04598].

Efficient edge domination is strictly stronger. A DIM is a PED-set in which no two selected edges are adjacent, and every edge of \(G\) is dominated by exactly one selected edge. Every DIM is a PED-set, and whenever a DIM exists it is a PED-set of minimum cardinality [2607.03894]. This distinction is central in both hardness proofs and positive algorithms: many tractable cases first test for a DIM, then compare it with the trivial set \(E(G)\), and finally analyze the genuinely proper PED configurations [1705.08379, 1502.01523, 2509.04598].

## 2. Structural characterization by vertex colorings

A central structural tool is the vertex \(3\)-coloring associated with a PED-set. Given a connected graph and a perfect edge dominating set \(P\), one partitions the vertices into:

- **black** vertices \(B\): vertices incident with at least two edges of \(P\),
- **yellow** vertices \(Y\): vertices incident with exactly one edge of \(P\),
- **white** vertices \(W\): vertices incident with no edge of \(P\) [1705.08379, 2607.03894].

In the circular-arc treatment, the same role is played by a black/gray/white coloring, with \(D\) the set of vertices incident to selected edges, \(B=\{v\in D:N[v]\subseteq D\}\), \(R=D\setminus B\), and \(W=V(G)\setminus D\) [1502.01523].

The later PED literature isolates the valid colorings precisely. A coloring is valid exactly when:

1. \(W\) is an independent set;
2. a vertex is yellow iff it is a leaf of \(G-W\);
3. every white vertex has only yellow neighbors; and
4. every black vertex has no white neighbors and degree at least two [2607.03894].

Conversely, every coloring satisfying these conditions corresponds to a unique PED-set, namely the set of edges whose endpoints are both non-white [2607.03894]. The earlier circular-arc formulation encodes the same mechanism through two properties:  
**(P1)** each gray vertex has exactly one non-white neighbor, all its other neighbors being white;  
**(P2)** if \(v\in W\), then \(N(v)\subseteq R\), hence \(W\) is independent [1502.01523].

This coloring formalism has strong immediate consequences. Every induced \(K_t\) with \(t\ge 4\) must have all vertices black. Every induced triangle has either three black vertices or two yellow vertices and one white vertex [1705.08379]. These local constraints are repeatedly used to rule out proper PED-sets in triangle-rich graph classes and to force finite pattern lists in \(P_5\)-free and \(P_6\)-free algorithms [1705.08379, 2509.04598].

For weighted problems, the coloring viewpoint yields a useful objective transformation. If \(\omega:E(G)\to\mathbb{R}\) and
\[
\psi(u)=\sum_{v\in N_G(u)}\omega(uv),
\]
then for the PED-set induced by a valid coloring \((B,Y,W)\),
\[
\omega(P)=\frac{\psi(V(G))}{2}-\psi(W).
\]
Minimizing \(\omega(P)\) is therefore equivalent to maximizing \(\psi(W)\) [2509.04598].

## 3. Complexity landscape

The general problem is computationally hard in several strong senses. One NP-completeness result applies to **claw-free graphs of degree at most \(3\)**. The reduction is based on the **shield graph** and a **magnification** operation. If \(G\) is cubic and \(M(G)\) is its magnification, then
\[
G \text{ has an efficient edge dominating set } D \iff M(G) \text{ has a perfect edge dominating set } P \text{ of size at most } 37n/2,
\]
which yields NP-hardness for minimum perfect edge domination on claw-free graphs of degree at most \(3\) [1705.08379].

A second hardness construction applies to **bounded-degree graphs with large girth**. For an \(r\)-regular graph \(G\), the \(3k\)-subdivision \(S(G)\) forces rigid local behavior: for every perfect edge dominating set \(P\) of \(S(G)\), each subdivided edge gadget contains at least \(k\) selected edges, and the equality case induces a specific white/yellow endpoint pattern [1705.08379]. This leads to NP-hardness of the cardinality problem on graphs of bounded degree \(r\) and girth at least \(k\), for any fixed \(r,k\ge 3\), and in particular on \(r\)-regular graphs for every \(r\ge 3\) [1705.08379].

A major hereditary-class theorem gives a sharp bounded-degree dichotomy. Let \(H\) be fixed, and let \(\mathcal{G}\) be the class of \(H\)-free graphs of maximum degree at most \(d\), for fixed \(d\ge 3\). Then perfect edge domination is polynomial-time solvable if \(H\) is a **linear forest**, and NP-complete otherwise [1705.08379]. The hard side splits according to whether \(H\) contains an induced cycle or a vertex of degree at least \(3\); the easy side uses the fact that bounded-degree \(P_q\)-free connected graphs have bounded size [1705.08379].

Later work strengthened the hardness picture in the absence of DIMs. For a connected **DIM-less** graph, deciding whether it admits a non-trivial PED-set is NP-complete. Since every graph has the trivial PED-set \(E(G)\), this implies that deciding whether a graph has a **proper** PED-set is NP-complete, and that deciding whether a DIM-less graph has at least two PED-sets is NP-complete [2509.04598]. This result isolates the genuinely PED-specific difficulty after the efficient-edge-domination case has been excluded.

## 4. Polynomial-time solvable classes

The positive side of the theory is driven by graph classes in which the coloring constraints collapse the search space.

For **connected cubic claw-free graphs**, every vertex lies in some triangle, and if every vertex of a connected graph lies in a triangle then the graph has no proper perfect edge dominating set. The proof uses black propagation: once a black vertex appears, the triangle constraints force adjacent vertices in triangles to be black, and connectivity propagates this to all vertices. As a consequence, on connected cubic claw-free graphs the weighted perfect edge domination problem reduces to comparing a minimum-weight DIM, if one exists, with the trivial set \(E(G)\), yielding an \(O(n)\)-time algorithm [1705.08379].

For **\(P_5\)-free graphs**, the weighted problem admits a **robust linear-time algorithm**: on arbitrary input, the algorithm either returns a minimum-weight PED-set or exhibits an induced \(P_5\) [1705.08379]. The approach uses the Bacsó–Tuza theorem that every connected graph contains an induced \(P_5\), a dominating clique, or a dominating \(P_3\). A principal vertex can be found in linear time or an induced \(P_5\) can be detected; from a principal vertex one obtains either a dominating induced \(P_3\), a dominating clique, or an induced \(P_5\). The non-trivial PED case reduces to a finite list of admissible color patterns on a dominating \(P_3\); if there is a dominating clique \(K_p\) with \(p>4\), then the only PED-set is the trivial one [1705.08379].

For **circular-arc graphs**, the minimum weighted perfect edge domination problem (**MWPED**) is solvable in \(O(n+m)\) time [1502.01523]. The algorithm is based on a circular-arc model \(\mathcal{M}=(C,\mathcal{A})\) and a case analysis driven by the overlap parameters
\[
\min_{p\in C}|\mathcal{A}(p)|,\qquad \max_{p\in C}|\mathcal{A}(p)|.
\]
The main cases are: two arcs covering the entire circle, three arcs covering the entire circle, Helly circular-arc models with a point covered by at least four arcs, overlap exactly three, and overlap exactly two with cycle-and-leaf structure. In the high-overlap cases, the problem is reduced to interval-graph MWPED by cutting arcs and using weight-preserving transformations; in the overlap-two case, the structure reduces to a controlled cycle with pendant arcs [1502.01523]. The same paper also gives a linear-time algorithm for minimum weighted efficient edge domination on circular-arc graphs, using the equivalences
\[
\text{MWEED on }G \equiv \text{MWEVD on }L(G),\qquad
\text{MWEED on }G \equiv \text{MWIS on }L^2(G),
\]
together with the fact that \(L^2(G)\) remains circular-arc [1502.01523].

For **\(P_6\)-free graphs**, there is a **cubic-time algorithm** for finding a minimum-cardinality PED-set, and the same framework adapts to the weighted version and to counting all PED-sets and all DIMs without increasing the asymptotic complexity [2509.04598]. The structural engine is the characterization that a graph is \(P_6\)-free iff every connected induced subgraph contains either a dominating induced \(C_6\) or a dominating complete bipartite subgraph, and such a dominating subgraph can be found in \(O(|V|^3)\) time [2509.04598]. On a dominating induced \(C_6\), only five valid partial colorings occur; on a dominating complete bipartite subgraph, the algorithm distinguishes the cases of no black vertices, exactly one black vertex, and at least two black vertices, then propagates forced colors through the remaining components [2509.04598].

## 5. Counting and extremal theory

The counting problem asks for the number \(\tilde{\mu}(G)\) of PED-sets of \(G\). This topic became algorithmically and extremally explicit in recent work [2607.03894].

For paths, the numbers satisfy
\[
\tilde{\mu}(P_n)=\tilde{\mu}(P_{n-1})+\tilde{\mu}(P_{n-3}) \qquad (n\ge 4),
\]
with
\[
\tilde{\mu}(P_1)=1,\qquad \tilde{\mu}(P_2)=1,\qquad \tilde{\mu}(P_3)=3.
\]
Hence
\[
\tilde{\mu}(P_4)=4,\quad \tilde{\mu}(P_5)=5,\quad \tilde{\mu}(P_6)=8,\quad \tilde{\mu}(P_7)=12,\quad \tilde{\mu}(P_8)=17
\]
[2607.03894].

Among all trees on \(n\) vertices, the path is extremal:
\[
\tilde{\mu}(T)\le \tilde{\mu}(P_n).
\]
Equality holds iff \(T\in\{K_{1,3},P_4\}\) when \(n=4\), iff \(T\in\{K_{1,4},P_5\}\) when \(n=5\), and iff \(T=P_n\) otherwise [2607.03894]. Stars satisfy
\[
\tilde{\mu}(K_{1,n-1})=n \qquad (n\ge 3),
\]
and this equals \(\tilde{\mu}(P_n)\) only for \(n=2,3,4,5\); for \(n\ge 6\), paths strictly beat stars [2607.03894].

For forests, PED-counts multiply over connected components:
\[
\tilde{\mu}(G)=\prod_{i=1}^k \tilde{\mu}(G_i).
\]
The extremal forest problem is therefore a balancing problem over component sizes. The exact extremal families are determined for all small \(n\), and for \(n\ge 13\) the unique extremal forest on \(n\) vertices is again \(P_n\) [2607.03894].

For **chordal graphs**, the decisive structural theorem is that in an extremal graph, any connected component containing a triangle must be exactly that triangle. Since
\[
\tilde{\mu}(K_3)=4,
\]
an extremal chordal graph decomposes into isolated triangles plus an extremal forest remainder [2607.03894]. The resulting bound is
\[
\tilde{\mu}(G)\le f(n),
\]
where
\[
f(n)=
\begin{cases}
1 & n\le 2,\\[2mm]
4^{n/3} & n\ge 3,\ n\equiv 0\pmod 3,\\[2mm]
5\cdot 4^{(n-5)/3} & n\ge 5,\ n\equiv 2\pmod 3,\\[2mm]
4^{(n-1)/3} & n\ge 4,\ n\equiv 1\pmod 3.
\end{cases}
\]
Equality is characterized exactly by disjoint unions of triangles together with the optimal residual forest from the tree classification [2607.03894].

The same work gives **linear-time counting algorithms** for PED-sets and DIMs in **generalized series-parallel graphs** and **chordal graphs** [2607.03894]. For generalized series-parallel graphs \(G(u,v)\), the dynamic program uses states \(p_{\alpha,\beta}(G)\), with \(\alpha,\beta\in\{0,1,2,3,4\}\), encoding terminal colors and degree types. The base graph \(K_2\) has only
\[
p_{4,0}(K_2)=p_{0,4}(K_2)=p_{2,2}(K_2)=1,
\]
all others zero. Explicit recurrences are given for series-1, series-2, and parallel composition, and since the state space is fixed, bottom-up processing of the parse tree yields \(O(n+m)\) time [2607.03894]. For chordal graphs, maximal cliques of size at least \(4\) force all their vertices to be black in any valid coloring; after peeling them off, the remaining pieces have clique number at most \(3\) and are generalized series-parallel, so the same dynamic program applies [2607.03894].

The counting theory also motivates an open extremal direction: the conjecture that among all connected graphs on \(n\) vertices, the cycle \(C_n\) maximizes the number of PED-sets. Supporting evidence includes the recurrence
\[
\tilde{\mu}(C_n)=\tilde{\mu}(C_{n-1})+\tilde{\mu}(C_{n-3}) \qquad (n\ge 6)
\]
and the fact that \(P_n\) has fewer PED-sets than \(C_n\) for all \(n\ge 3\) [2607.03894].

## 6. Relation to adjacent domination notions

Perfect edge domination sits in a broader family of edge-dominating and edge-covering concepts, but several nearby notions are distinct.

The most immediate comparison is with **ordinary edge domination**. An edge dominating set only requires that every edge outside the set share a vertex with some selected edge; perfect edge domination adds the **exactly one** requirement for all unselected edges [1705.08379]. This exactness makes the \(3\)-coloring method possible and is the source of both the added hardness and the stronger structure theorems.

A different refinement is **edge cut domination**. In a connected graph, a set \(F\subseteq E\) is an edge cut dominating set if it is an edge dominating set and the subgraph \((V,E-F)\) is disconnected; the minimum size is \(\gamma_{ct}(G)\) [1605.04330]. This notion is not perfect edge domination. The relationship stated in the source is conceptual: in a perfect edge dominating set, every edge outside the set is adjacent to exactly one edge in the set, whereas edge cut domination requires domination plus disconnection after removing the set. In that sense, edge cut domination is weaker in the “exactly one” direction and stronger in the connectivity direction [1605.04330].

Another neighboring line is the theory of **well-edge-dominated graphs**, where all minimal edge dominating sets have the same cardinality [2412.10926]. This is again not perfect edge domination, but it is structurally close because every matching is a minimal edge dominating set, so every well-edge-dominated graph is equimatchable [2412.10926]. Recent classification results include a complete description of connected well-edge-dominated graphs containing exactly one triangle,
\[
\mathcal{T}\cup\mathcal{F}\cup\{K_3,C^\#,H,DH\},
\]
and the outerplanar classification
\[
\{C_3,C_4,C_5,H,F_5,C_7,C^\#,DH\}
\]
[2412.10926]. These results bear on PED indirectly, chiefly through the interaction between minimal edge domination, matchings, and triangle structure.

Algorithmically, parameterized work on **Edge Dominating Set** is also adjacent rather than identical. A notable framework enumerates minimal vertex covers up to size \(2k\), tracks a partition \((C,I,U_1,U_2)\), and obtains an \(O^*(2.3147^k)\)-time algorithm together with a kernel satisfying
\[
|V(G')|\le 2k'^2+2k',\qquad |E(G')|=O(k'^3),\qquad k'\le k
\]
[1104.4160]. The source explicitly notes that this does not enforce the stronger perfect condition by itself, but that the endpoint-tracking and branching architecture is structurally close to PEDS-style enumeration [1104.4160].

Finally, there is a vertex–edge analogue, **ve-domination**, in which a vertex dominates an edge if it is incident with the edge or adjacent to one of its endpoints. The class of **well-ve-dominated graphs** studies uniformity of minimal ve-dominating sets, not classical edge-selected PED-sets [2512.12231]. Its strongest perfect-like statement is a tree characterization: a reduced tree is well-ve-dominated iff there exists an independent set
\[
I\subseteq L_T\cup S_T
\]
such that every edge of the tree is ve-dominated by exactly one vertex of \(I\) [2512.12231]. This suggests a broader theme: unique edge coverage can be formulated either by selecting edges, as in perfect edge domination, or by selecting vertices, as in ve-domination, but the two theories are distinct.

Perfect edge domination is therefore best understood as one member of a tightly connected family: stronger than ordinary edge domination, weaker than efficient edge domination, orthogonal to cut-based refinements, and structurally related to well-domination and matching-uniformity phenomena. The literature shows that this intermediate position is mathematically rich: it admits exact \(3\)-coloring characterizations, sharp hereditary complexity dichotomies, robust linear-time algorithms on some classes, cubic-time algorithms on others, and a developing extremal and counting theory [1705.08379, 2509.04598, 1502.01523, 2607.03894].

Source: https://www.emergentmind.com/topics/perfect-edge-dominating-set