TreePlot[{v i 1 -> v j 1, v i 2 -> v j 2, ...}] generates a tree plot of the graph in which vertex v_ik is connected to vertex v_jk.TreePlot[{{v i 1 -> v j 1, lbl_1}, ...}] ...

For many kinds of practical calculations, the only operations you will need to perform on polynomials are essentially structural ones. If you do more advanced algebra with ...

Typical ways to enter characters. All printable ASCII characters can be entered directly. Those that are not alphanumeric are assigned explicit names in Mathematica, allowing ...

TreePlot lays out the vertices of a graph in a tree of successive layers, or a collection of trees. If the graph g is not a tree, TreePlot lays out its vertices on the basis ...

TreeGraph[{v_1, v_2, ...}, {u_1, u_2, ...}] yields a tree where u_i is the predecessor of v_i.TreeGraph[{e_1, e_2, ...}] yields a tree with edges e_j.TreeGraph[{v_1, v_2, ...

AdjacencyGraph[amat] gives the graph with adjacency matrix amat.AdjacencyGraph[{v_1, v_2, ...}, amat] gives the graph with vertices v_i and adjacency matrix amat.

PathGraph[{v_1, v_2, ...}] yields a path with vertices v_i and edges between v_i and v i +\[ThinSpace]1 .PathGraph[{e_1, e_2, ...}] yields a path with edges ...

Graph[{e_1, e_2, ...}] yields a graph with edges e_j.Graph[{v 1, v 2, ...}, {e_1, e_2, ...}] yields the graph with vertices v_i and edges e_j. Graph[{..., w_i[v_i, ...], ...

Mathematica includes a wide selection of carefully chosen color schemes that can immediately be used throughout the Mathematica graphics and visualization system.

AlgebraicNumber[\[Theta], {c_0, c_1, ..., c_n}] represents the algebraic number in the field \[DoubleStruckCapitalQ][\[Theta]] given by c_0 + c_1 \[Theta] + ... + c_n ...