# independenceNumber -- computes the independence number of a graph

## Synopsis

• Usage:
alpha = independenceNumber G
• Inputs:
• G, an instance of the type Graph,
• Outputs:
• alpha, an integer, the independence number of G

## Description

The independence number of a graph G is the maximum number of vertexSet in any independent set of G.

 i1 : G = graph({{1,2},{2,3},{3,4},{4,5}},EntryMode=>"edges"); i2 : independenceNumber G o2 = 3