Search Results for ""

A graph is claw-free iff it does not contain the complete bipartite graph K_(1,3) (known as the "claw graph"; illustrated above) as a forbidden induced subgraph. The line ...

The complex numbers are the field C of numbers of the form x+iy, where x and y are real numbers and i is the imaginary unit equal to the square root of -1, sqrt(-1). When a ...

If two numbers b and c have the property that their difference b-c is integrally divisible by a number m (i.e., (b-c)/m is an integer), then b and c are said to be "congruent ...

A connected graph is graph that is connected in the sense of a topological space, i.e., there is a path from any point to any other point in the graph. A graph that is not ...

The cube-connected cycle graph of order n is the graph obtained by replacing each vertex in a n-dimensional hypercube by a cycle of length n. They were introduced by ...

The cycloid is the locus of a point on the rim of a circle of radius a rolling along a straight line. It was studied and named by Galileo in 1599. Galileo attempted to find ...

The simplest class of one-dimensional cellular automata. Elementary cellular automata have two possible values for each cell (0 or 1), and rules that depend only on nearest ...

A fixed point is a point that does not change upon application of a map, system of differential equations, etc. In particular, a fixed point of a function f(x) is a point x_0 ...

The happy end problem, also called the "happy ending problem," is the problem of determining for n>=3 the smallest number of points g(n) in general position in the plane ...

Let two points x and y be picked randomly from a unit n-dimensional hypercube. The expected distance between the points Delta(n), i.e., the mean line segment length, is then ...