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 ...
WeightedAdjacencyMatrix[g] gives the adjacency matrix of edge weights of the graph g.
BernoulliGraphDistribution[n, p] represents a Bernoulli graph distribution for n-vertex graphs with edge probability p.
CompleteGraph[n] gives the complete graph with n vertices K_n.CompleteGraph[{n_1, n_2, ..., n_k}] gives the complete k-partite graph with n_1 + n_2 + \[CenterEllipsis] + n_k ...
EdgeLabeling is an option for GraphPlot and related functions that specifies whether labeling specified for edges should be displayed by default.
Basic plotting functions. This plots a graph of sin(x) as a function of x from 0 to 2π. You can plot functions that have singularities. Mathematica will try to choose ...
ConnectedGraphQ[g] yields True if the graph g is connected, and False otherwise.
GridGraph[{m, n}] gives the grid graph with m*n vertices G m, n.GridGraph[{n_1, n_2, ..., n_k}] gives the k-dimensional grid graph with n_1*n_2*\[CenterEllipsis]*n_k vertices ...
PieChart3D[{y_1, y_2, ...}] makes a 3D pie chart with sector angle proportional to y_1, y_2, ....PieChart3D[{..., w_i[y_i, ...], ..., w_j[y_j, ...], ...}] makes a 3D pie ...
Long the standard for high-quality function and surface visualization, Mathematica incorporates a host of original numeric, symbolic, and geometric algorithms that automate ...