RandomTree[n] constructs a random labeled tree on n vertices.
RankGraph[g, l] partitions the vertices into classes based on the shortest geodesic distance to a member of list l.
TreeIsomorphismQ[t_1, t_2] yields True if the trees t_1 and t_2 are isomorphic. It yields False otherwise.
TreeToCertificate[t] returns a binary string that is a certificate for the tree t such that trees have the same certificate if and only if they are isomorphic.
Zoom
(Combinatorica Package Symbol) Zoom[{i, j, k, ...}] is a value that the PlotRange option can take on in ShowGraph. Setting PlotRange to this value zooms the display to contain the specified subset of ...
Mathematica provides a broad range of powerful constructs for laying out content on a screen or page. They are designed to be immediately useful for the beginner, yet also ...
EdgeForm[g] is a graphics directive which specifies that edges of polygons and other filled graphics objects are to be drawn using the graphics directive or list of ...
OrderStarKind is an option to OrderStarPlot that specifies the type of order star to be displayed.
The world's largest integrated web of mathematical capabilities and algorithms
PermutationGroup[{perm_1, ..., perm_n}] represents the group generated by multiplication of the permutations perm_1, ..., perm_n.