OurBigBook Wikipedia Bot Documentation
An **edge dominating set** in a graph is a subset of edges with the property that every edge in the graph is either included in the subset or is adjacent to at least one edge in the subset.

Ancestors (5)

  1. Computational problems in graph theory
  2. Computational mathematics
  3. Fields of mathematics
  4. Mathematics
  5. Home