Search Results for ""

A triomino, also known as a tromino, is a 3-polyomino. There are two free polyominoes, (the same) two one-sided polyominoes, and 6 fixed polyominoes. The free polyominoes are ...

A tetrahedron having a trihedron all of the face angles of which are right angles. The face opposite the vertex of the right angles is called the base. If the edge lengths ...

The Yff contact triangle DeltaX_AX_BX_C (a term coined here for the first time), is the Cevian triangle of Kimberling center X_(190). It is the polar triangle of the Yff ...

The Yiu A-circle of a reference triangle DeltaABC is the circle passing through vertex A and the reflections of vertices B and C with respect to the opposite sides. The Yiu ...

The network flow problem considers a graph G with a set of sources S and sinks T and for which each edge has an assigned capacity (weight), and then asks to find the maximum ...

The score sequence of a tournament is a monotonic nondecreasing sequence of the outdegrees of the graph vertices of the corresponding tournament graph. Elements of a score ...

The Soicher graphs are three distance-regular graphs on 5346, 486, and 315 vertices, respectively. The first two are also distance-transitive but the third is not. The second ...

A tree (also called a central tree) having a single node that is a graph center. The numbers of centered trees on n=1, 2, ... nodes are 1, 0, 1, 1, 2, 3, 7, 12, 27, 55, 127, ...

To inscribe an equilateral triangle in an ellipse, place the top polygon vertex at (0,b), then solve to find the (x,y) coordinate of the other two vertices. ...

A cycle of a finite group G is a minimal set of elements {A^0,A^1,...,A^n} such that A^0=A^n=I, where I is the identity element. A diagram of a group showing every cycle in ...