The ratio of the independence number of a graph G to its vertex count is known as the independence ratio of G. The product of the chromatic number and independence ratio of a graph is at least 1. Precomputed independence numbers for many named graphs can be obtained in the Wolfram Language using GraphData[graph, IndependenceRatio].

independence number | independence polynomial | independent set | matching number