Well-covered graph
Graph with equal-size maximal independent sets
In graph theory, a well-covered graph is an undirected graph in which the minimal vertex covers all have the same size.
Graph with equal-size maximal independent sets
In graph theory, a well-covered graph is an undirected graph in which the minimal vertex covers all have the same size.
Graph with equal-size maximal independent sets
Nobody has pulled this card yet. The first copy makes you its discoverer.
In graph theory, a well-covered graph is an undirected graph in which the minimal vertex covers all have the same size. Here, a vertex cover is a set of vertices that touches all edges, and it is minimal if removing any vertex from it would leave some edge uncovered. Equivalently, well-covered graphs are the graphs in which all maximal independent sets have equal size. Well-covered graphs were defined and first studied by Michael D. Plummer in 1970.
No sale yet.
None on the Market right now.