Search Results for ""

A stem-and-leaf diagram, also called a stem-and-leaf plot, is a diagram that quickly summarizes data while maintaining the individual data points. In such a diagram, the ...

A subgraph G^' of a graph G is a graph G^' whose vertex set and edge set are subsets of those of G. If G^' is a subgraph of G, then G is said to be a supergraph of G^' ...

The Szilassi polyhedron is a heptahedron that is topologically equivalent to a torus and for which every pair of faces has a polygon edge in common. The Szilassi polyhedron ...

The matrix product of a square set of data d and a matrix of basis vectors consisting of Walsh functions. By taking advantage of the nested structure of the natural ordering ...

The 10.1.2 equation A^(10)=B^(10)+C^(10) (1) is a special case of Fermat's last theorem with n=10, and so has no solution. No 10.1.n solutions are known with n<13. A 10.1.13 ...

A generalization of the polyominoes using a collection of equal-sized equilateral triangles (instead of squares) arranged with coincident sides. Polyiamonds are sometimes ...

An automorphism of a graph is a graph isomorphism with itself, i.e., a mapping from the vertices of the given graph G back to vertices of G such that the resulting graph is ...

An acnode, also called an isolated point or hermit point, of a curve is a point that satisfies the equation of the curve but has no neighboring points that also lie on the ...

A term invented by B. Grünbaum in an attempt to promote concrete and precise polyhedron terminology. The word "coptic" derives from the Greek for "to cut," and acoptic ...

The value nearest to but still inside an inner fence.