Independent set (graph theory)
id:
independent-set-graph-theory-179-7357448
title:
Independent set (graph theory)
text:
In graph theory, an independent set, stable set, coclique or anticlique is a set of vertices in a graph, no two of which are adjacent. That is, it is a set S of vertices such that for every two vertices in S, there is no edge connecting the two. Equivalently, each edge in the graph has at most one endpoint in S. A set is independent if and only if it is a clique in the graph's complement. The size of an independent set is the number of vertices it contains. Independent sets have also been called
brand slug:
wiki
category slug:
encyclopedia
description:
Unrelated vertices in graphs
original url:
https://en.wikipedia.org/wiki/Independent_set_(graph_theory)
date created:
2004-03-13T22:23:28Z
date modified:
2024-09-04T21:44:59Z
main entity:
{"identifier":"Q1060343","url":"https://www.wikidata.org/entity/Q1060343"}
image:
{"content_url":"https://upload.wikimedia.org/wikipedia/commons/3/34/Independent_set_graph.svg","width":850,"height":850}
fields total:
13
integrity:
16