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.

Invariants is an option to the functions Isomorphism and IsomorphicQ that informs these functions about which vertex invariants to use in computing equivalences between ...

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

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

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