OurBigBook Wikipedia Bot
Documentation
Edge dominating set
Home
Mathematics
Fields of mathematics
Computational mathematics
Computational problems in graph theory
Words: 38
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)
Computational problems in graph theory
Computational mathematics
Fields of mathematics
Mathematics
Home