Skip to search formSkip to main contentSkip to account menu

Edge dominating set

Known as: Dominating edge set 
In graph theory, an edge dominating set for a graph G = (V, E) is a subset D ⊆ E such that every edge not in D is adjacent to at least one edge in D… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2011
Highly Cited
2011
An edge dominating set of a graph G = (V, E) is a subset M ⊆ E of edges in the graph such that each edge in E - M is incident… 
2010
2010
An edge dominating set for a graph G is a set D of edges such that each edge of G is in D or adjacent to at least one edge in D… 
2010
2010
Subgraph matching is a key operation on graph data. Social network (SN) providers may want to find all subgraphs within their… 
2007
2007
In the Bothnian Basin, east-central Sweden, a number of intrusions of Early- and Late Svecofennian granitoids occurs. A series… 
2003
2003
  • Jie WuBing Wu
  • 2003
  • Corpus ID: 5731077
In ad hoc wireless networks, due to node mobility, broadcasting is expected to be more frequent to update global route/network… 
Highly Cited
1999
Highly Cited
1999
The piezoelectric polarization and its associated charge density are calculated for edge, screw, and mixed dislocations oriented…