Search Results for ""

Let a graph G have graph vertices with vertex degrees d_1<=...<=d_m. If for every i<n/2 we have either d_i>=i+1 or d_(n-i)>=n-i, then the graph is Hamiltonian.

It is possible to place 7 cigarettes in such a way that each touches every other if l/d>7sqrt(3)/2 (Gardner 1959, p. 115).

The encrypted form of a plaintext.

An ellipse intersects a circle in 0, 1, 2, 3, or 4 points. The points of intersection of a circle of center (x_0,y_0) and radius r with an ellipse of semi-major and ...

Taking the locus of midpoints from a fixed point to a circle of radius r results in a circle of radius r/2. This follows trivially from r(theta) = [-x; 0]+1/2([rcostheta; ...

A circle bundle pi:E->M is a fiber bundle whose fibers pi^(-1)(x) are circles. It may also have the structure of a principal bundle if there is an action of SO(2) that ...

An arrangement of overlapping circles which cover the entire plane. A lower bound for a covering using equivalent circles is 2pi/sqrt(27) (Williams 1979, p. 51).

In Homogeneous coordinates (x_1,x_2,x_3), the equation of a circle C is a(x_1^2+x_2^2)+2fx_2x_3+2gx_1x_3+cx_3^2=0. The discriminant of this circle is defined as Delta=|a 0 g; ...

The inverse curve of the circle with parametric equations x = acost (1) y = asint (2) with respect to an inversion circle with center (x,y) and radius R is given by x_i = ...

The pedal curve of circle involute f = cost+tsint (1) g = sint-tcost (2) with the center as the pedal point is the Archimedes' spiral x = tsint (3) y = -tcost. (4)