Search Results for ""

The 3-node tournament (and directed graph) illustrated above (Harary 1994, p. 205).

A formal structure for the organization of information. Examples of data structures include the list, queue, stack, and tree.

A binary relation associated with an instance of the stable marriage problem. Stable marriages correspond to vertices with outdegree 0 in the divorce digraph (Skiena 1990, p. ...

Let ABCD be a quadrilateral with perpendicular polygon diagonals. The midpoints of the sides (a, b, c, and d) determine a parallelogram (the Varignon parallelogram) with ...

Given a triangle DeltaA_1A_2A_3, the points A_1, I, and J_1 lie on a line, where I is the incenter and J_1 is the excenter corresponding to A_1. Furthermore, the circle with ...

If the tangents at B and C to the circumcircle of a triangle DeltaABC intersect in a point K_1, then the circle with center K_1 and which passes through B and C is called the ...

Given two circles, draw the tangents from the center of each circle to the sides of the other. Then the line segments AB and CD are of equal length. The theorem can be proved ...

A functional graph is a directed graph in which each vertex has outdegree one, and can therefore be specified by a function mapping {1,...,n} onto itself. Functional graphs ...

Given n circles and a perimeter p, the total area of the convex hull is A_(Convex Hull)=2sqrt(3)(n-1)+p(1-1/2sqrt(3))+pi(sqrt(3)-1). Furthermore, the actual area equals this ...

The Johnson midpoint is the point of concurrence of the line segments joining the vertices of a reference triangle with the centers of a certain set of circles (that resemble ...