# Efficient Domination and Efficient Edge Domination: A Brief Survey

@inproceedings{Brandstdt2018EfficientDA,
title={Efficient Domination and Efficient Edge Domination: A Brief Survey},
author={Andreas Brandst{\"a}dt},
booktitle={CALDAM},
year={2018}
}
In a finite undirected graph $$G=(V,E)$$, a vertex $$v \in V$$ dominates itself and its neighbors in G. A vertex set $$D \subseteq V$$ is an efficient dominating set (e.d.s. for short) of G if every $$v \in V$$ is dominated in G by exactly one vertex of D.
4 Citations
Some New Results on Efficient and Perfect Edge Domination of Graphs
• Mathematics
ArXiv
• 2022
A neighborhood star-free graph is one in which every vertex of degree at least two is contained in a triangle. This class has been considered be-fore, in the context of edge domination. In the
Optimized and Frequent Subgraphs: How Are They Related?
• Computer Science
IEEE Access
• 2018
The aim of this paper is to suggest an optimization strategy to uncover the association between the frequent and the optimized subgraph patterns, and a Particle Swarm Optimization technique is suggested.

## References

SHOWING 1-10 OF 73 REFERENCES
New Polynomial Cases of the Weighted Efficient Domination Problem
• Mathematics
MFCS
• 2013
The Efficient Domination (ED) problem, which asks for the existence of an e.d. in G, is known to be $$\mathbb{NP}$$-complete even for very restricted graph classes.
Efficient and Perfect domination on circular-arc graphs
• Mathematics
Electron. Notes Discret. Math.
• 2015
Perfect edge domination and efficient edge domination in graphs
• Mathematics, Computer Science
Discret. Appl. Math.
• 2002
The Weighted Perfect Domination Problem and Its Variants
• Mathematics, Computer Science
Discret. Appl. Math.
• 1996
On Efficient Domination for Some Classes of H-Free Chordal Graphs
• Mathematics
Electron. Notes Discret. Math.
• 2017
Weighted Efficient Domination for P5-Free Graphs in Linear Time
It is shown that, based on modular decomposition, ED is solvable in linear time for $P_5$-free graphs.
Efficient domination for classes of P6-free graphs
• Mathematics
Discret. Appl. Math.
• 2017
Efficient edge domination in regular graphs
• Mathematics
Discret. Appl. Math.
• 2008