TuranGraph[n, k] gives the k-partite Turán graph with n vertices T n, k.
WeibullDistribution[\[Alpha], \[Beta]] represents a Weibull distribution with shape parameter \[Alpha] and scale parameter \[Beta].WeibullDistribution[\[Alpha], \[Beta], ...
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 ...
WheelGraph[n] gives the wheel graph with n vertices W_n.
A Diophantine polynomial system is an expression constructed with polynomial equations and inequalities combined using logical connectives and quantifiers where the variables ...
OrderStarLegend is an option to OrderStarPlot that specifies whether to display the legend of symbols used to represent zeros, poles and interpolation points.
RasterSize is an option for Rasterize and related functions that determines the absolute pixel size of the raster generated.
DiscreteWaveletPacketTransform[data] gives the discrete wavelet packet transform (DWPT) of an array of data.DiscreteWaveletPacketTransform[data, wave] gives the discrete ...
Graph
(Built-in Mathematica Symbol) 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, ...], ...
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.