Edge dominating set
id:
edge-dominating-set-309-1661334
title:
Edge dominating set
text:
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. An edge dominating set is also known as a line dominating set. Figures (a)–(d) are examples of edge dominating sets (thick red lines). A minimum edge dominating set is a smallest edge dominating set. Figures (a) and (b) are examples of minimum edge dominating sets (it can be checked that there is no edge dominating set of size 2 for this graph).
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Edge_dominating_set
date created:
date modified:
2023-12-03T02:38:00Z
main entity:
{"identifier":"Q5337698","url":"https://www.wikidata.org/entity/Q5337698"}
image:
{"content_url":"https://upload.wikimedia.org/wikipedia/commons/e/e3/Edge-dominating-set.svg","width":140,"height":240}
fields total:
13
integrity:
14