DegreesOf2Neighborhood[g, v] returns the sorted list of degrees of vertices of graph g within a distance of 2 from v.

DistinctPermutations[l] gives all permutations of the multiset described by list l.

ExtractCycles[g] gives a maximal list of edge-disjoint cycles in graph g.

FindCycle[g] finds a list of vertices that define a cycle in graph g.

FiniteGraphs produces a convenient list of all the interesting, finite, parameterless graphs built into Combinatorica.

GraphCenter[g] gives a list of the vertices of graph g with minimum eccentricity.

GraphicQ[s] yields True if the list of integers s is a graphic sequence, and thus represents a degree sequence of some graph.

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.

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