Source: wikibot/well-covered-graph
= Well-covered graph
{wiki=Well-covered_graph}
A graph is said to be **well-covered** if all of its maximal independent sets are of the same size. An independent set of a graph is a set of vertices no two of which are adjacent. A maximal independent set is an independent set that cannot be extended by including any adjacent vertex.