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 ...

HararyGraph[k, n] generates the minimal k-connected graph on n vertices H k, n.

KaryTree[n] gives a binary tree with n vertices.KaryTree[n, k] gives a k-ary tree with n vertices.

ListLogPlot[{y_1, y_2, ...}] makes a log plot of the y_i, assumed to correspond to x coordinates 1, 2, ....ListLogPlot[{{x_1, y_1}, {x_2, y_2}, ...}] makes a log plot of the ...

RandomGraph[{n, m}] gives a pseudorandom graph with n vertices and m edges.RandomGraph[{n, m}, k] gives a list of k pseudorandom graphs.RandomGraph[gdist, ...] samples from ...

StarGraph[n] gives the star graph with n vertices S_n.

WeightedAdjacencyGraph[wmat] gives the graph with weighted adjacency matrix wmat.WeightedAdjacencyGraph[{v_1, v_2, ...}, wmat] gives the graph with vertices v_i and weighted ...

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 ...

BinormalDistribution[{\[Mu]_1, \[Mu]_2}, {\[Sigma]_1, \[Sigma]_\ 2}, \[Rho]] represents a bivariate normal distribution with mean {\[Mu]_1, \[Mu]_2} and covariance matrix ...

This example demonstrates various techniques for designing a progress bar dialog and a number of options available to wrap the reusable widget involved. Here is one technique ...