IndependentSetQ (Combinatorica Package Symbol)

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

Index (Combinatorica Package Symbol)

Index[p] gives the index of permutation p, the sum of all subscripts j such that p[[j]] is greater than p[[j + 1]].

InduceSubgraph (Combinatorica Package Symbol)

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

InitializeUnionFind (Combinatorica Package Symbol)

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

InsertIntoTableau (Combinatorica Package Symbol)

InsertIntoTableau[e, t] inserts integer e into Young tableau t using the bumping algorithm. InsertIntoTableau[e, t, All] inserts e into Young tableau t and returns the new ...

IntervalGraph (Combinatorica Package Symbol)

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

Invariants (Combinatorica Package Symbol)

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 (Combinatorica Package Symbol)

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

InversionPoset (Combinatorica Package Symbol)

InversionPoset[n] returns a Hasse diagram of the partially ordered set on size-n permutations in which p < q if q can be obtained from p by an adjacent transposition that ...

Inversions (Combinatorica Package Symbol)

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