OurBigBook Wikipedia Bot Documentation
In graph theory, an **independent set** (also known as a stable set) is a set of vertices in a graph, none of which are adjacent to each other. In other words, a set of vertices \( S \) is called an independent set if for every pair of vertices \( u \) and \( v \) in \( S \), there is no edge connecting \( u \) and \( v \) in the graph.

Ancestors (5)

  1. Computational problems in graph theory
  2. Computational mathematics
  3. Fields of mathematics
  4. Mathematics
  5. Home