Hypercube[n] constructs an n-dimensional hypercube.

IdentityPermutation[n] gives the size-n identity permutation.

IndependentSetQ[g, i] yields True if the vertices in list i define an independent set in graph g.

InduceSubgraph[g, s] constructs the subgraph of graph g induced by the list of vertices s.

InitializeUnionFind[n] initializes a union-find data structure for n elements.

IntervalGraph[l] constructs the interval graph defined by the list of intervals l.

InversePermutation[p] yields the multiplicative inverse of permutation p.

Inversions[p] counts the number of inversions in permutation p.

InvolutionQ[p] yields True if permutation p is its own inverse.

IsomorphismQ[g, h, p] tests if permutation p defines an isomorphism between graphs g and h.