Search Results for ""

The intersection of two lines L_1 and L_2 in two dimensions with, L_1 containing the points (x_1,y_1) and (x_2,y_2), and L_2 containing the points (x_3,y_3) and (x_4,y_4), is ...

The depth of a box is the horizontal distance from front to back (usually not necessarily defined to be smaller than the width, the horizontal distance from side to side).

The Sims graph is a distance-transitive graph on 352 vertices (Brouwer et al. 1989, p. 370).

The width of a box is the horizontal distance from side to side (usually defined to be greater than the depth, the horizontal distance from front to back).

The term "arbelos" means shoemaker's knife in Greek, and this term is applied to the shaded area in the above figure which resembles the blade of a knife used by ancient ...

The Cameron graph is a strongly regular Hamiltonian graph on 231 vertices with parameters (nu,k,lambda,mu)=(231,30,9,3). It is distance-regular with intersection array ...

A (finite, circular) conical surface is a ruled surface created by fixing one end of a line segment at a point (known as the vertex or apex of the cone) and sweeping the ...

A cyclic quadrilateral is a quadrilateral for which a circle can be circumscribed so that it touches each polygon vertex. A quadrilateral that can be both inscribed and ...

The cube is the Platonic solid composed of six square faces that meet each other at right angles and has eight vertices and 12 edges. It is also the uniform polyhedron with ...

The all-pairs shortest path problem is the determination of the shortest graph distances between every pair of vertices in a given graph. The problem can be solved using n ...