DepthFirstTraversal[g, v] performs a depth-first traversal of graph g starting from vertex v, and gives a list of vertices in the order in which they were encountered. ...
GraphPolynomial[n, x] returns a polynomial in x in which the coefficient of x^m is the number of nonisomorphic graphs with n vertices and m edges. GraphPolynomial[n, x, ...
Orbits
(Combinatorica Package Symbol) Orbits[pg, x] returns the orbits of x induced by the action of the group pg on x.
Path
(Combinatorica Package Symbol) Path[n] constructs a tree consisting only of a path on n vertices.
Star
(Combinatorica Package Symbol) Star[n] constructs a star on n vertices, which is a tree with one vertex of degree n - 1.
ConvexHullMedian[{{x_1, y_1}, ..., {x_n, y_n}}] estimates the median to be the mean of the bivariate data points lying on the innermost layer of the convex layers of the data.
Brake
(Function Approximations Package Symbol) Brake is an option to MiniMaxApproximation and GeneralMiniMaxApproximation that specifies how changes from one iteration to the next are to be restricted.
OrderStarInterpolation is an option to OrderStarPlot that specifies whether interpolation points of an approximant to a function should be displayed.
SimplexMedian[matrix] gives a simplex median of the elements in matrix.
ButcherAlpha
(Numerical Differential Equation Analysis Package Symbol) ButcherAlpha[tree] gives the number of ways of labeling the vertices of tree with a totally ordered set of labels such that if (m, n) is an edge, then m < n.