Search Results for ""

Two circles may intersect in two imaginary points, a single degenerate point, or two distinct points. The intersections of two circles determine a line known as the radical ...

Vizing's theorem states that a graph can be edge-colored in either Delta or Delta+1 colors, where Delta is the maximum vertex degree of the graph. A graph with edge chromatic ...

The complete bipartite graph K_(1,3) is a tree known as the "claw." It is isomorphic to the star graph S_4, and is sometimes known as the Y graph (Horton and Bouwer 1991; ...

Cospectral graphs, also called isospectral graphs, are graphs that share the same graph spectrum. The smallest pair of isospectral graphs is the graph union C_4 union K_1 and ...

The distance between two points is the length of the path connecting them. In the plane, the distance between points (x_1,y_1) and (x_2,y_2) is given by the Pythagorean ...

The double factorial of a positive integer n is a generalization of the usual factorial n! defined by n!!={n·(n-2)...5·3·1 n>0 odd; n·(n-2)...6·4·2 n>0 even; 1 n=-1,0. (1) ...

The Eisenstein integers, sometimes also called the Eisenstein-Jacobi integers (Finch 2003, p. 601), are numbers of the form a+bomega, where a and b are normal integers, ...

The Galton board, also known as a quincunx or bean machine, is a device for statistical experiments named after English scientist Sir Francis Galton. It consists of an ...

Gaussian elimination is a method for solving matrix equations of the form Ax=b. (1) To perform Gaussian elimination starting with the system of equations [a_(11) a_(12) ... ...

A geodesic dome is a triangulation of a Platonic solid or other polyhedron to produce a close approximation to a sphere (or hemisphere). The nth order geodesation operation ...