Search Results for ""
31 - 40 of 292 for Stem and Leaf plotsSearch Results
View search results from all Wolfram sites (63287 matches)Vince and Bóna (2012) define an assembly tree T for a connected simple graph G on n nodes as a binary rooted tree with n leavesTree Leaf and n-1 internal nodes and satisfying ...
A schematic mathematical illustration showing the relationships between or properties of mathematical objects.
Quantile-quantile plots (also called q-q plots) are used to determine if two data sets come from populations with a common distribution. In such a plot, points are formed ...
A Pólya plot is a plot of the vector field of (R[f(z)],-I[f(z)]) of a complex function f(z). Several examples are shown above. Pólya plots can be created in the Wolfram ...
A plot of equipotential curves. If desired, the regions between contours can be shaded or colored to indicate their magnitude. Contour plots are implemented in the Wolfram ...
A binary plot of an integer sequence is a plot of the binary representations of successive terms where each term is represented as a column of bits with 1s colored black and ...
An (n,k)-banana tree, as defined by Chen et al. (1997), is a graph obtained by connecting one leaf of each of n copies of an k-star graph with a single root vertex that is ...
A bar graph is any plot of a set of data such that the number of data elements falling within one or more categories is indicated using a rectangle whose height or width is a ...
A Bland-Altman plot is a data plotting method which simultaneously presents data sets from two different tests in a way that allows for easier determination of whether the ...
The time required for a given principal to double (assuming n=1 conversion period) for compound interest is given by solving 2P=P(1+r)^t, (1) or t=(ln2)/(ln(1+r)), (2) where ...
...