PageRankCentrality[g, \[Alpha]] gives a list of page-rank centralities for the vertices in the graph g and weight \[Alpha].PageRankCentrality[g, \[Alpha], \[Beta]] gives a ...
int MLTransferExpression (MLINK dst, MLINK src) transfers an expression to destination link dst from source link src.
CircularEmbedding[n] constructs a list of n points equally spaced on a circle. CircularEmbedding[g] embeds the vertices of g equally spaced on a circle.
CliqueQ
(Combinatorica Package Symbol) CliqueQ[g, c] yields True if the list of vertices c defines a clique in graph g.
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.
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.