Search Results for ""

An exmedian is a parallel to a side of a triangle through the opposite vertex. So in the above diagram, A_2^'A_3^' is the exmedian of side A_2A_3, and so on. The pairwise ...

A ruled surface is called a generalized cone if it can be parameterized by x(u,v)=p+vy(u), where p is a fixed point which can be regarded as the vertex of the cone. A ...

Given a point P in the interior of a triangle DeltaA_1A_2A_3, draw the cevians through P from each polygon vertex which meet the opposite sides at P_1, P_2, and P_3. Now, ...

Let K and L be simplicial complexes, and let f:K^((0))->L^((0)) be a map. Suppose that whenever the vertices v_0, ..., v_n of K span a simplex of K, the points f(v_0), ..., ...

The terminal side of an angle theta drawn in angle standard position is the side which isn't the initial side. When viewing an angle as the amount of rotation about the ...

The Balaban 11-cage is the unique 11-cage graph, derived via a tree excision from the 12-cage graph by Balaban (1973) and proven unique by McKay and Myrvold in 2003. It is ...

A search algorithm of a graph which explores all nodes adjacent to the current node before moving on. For cyclic graphs, care must be taken to make sure that no nodes are ...

An n-route is defined as a walk of length n with specified initial point in which no line succeeds itself.

A search algorithm of a tree that explores the first child of a node before visiting its siblings. Tarjan (1972) and Hopcroft and Tarjan (1973) showed that depth-first search ...

A local sink is a node of a directed graph with no exiting edges, also called a terminal (Borowski and Borwein 1991, p. 401; left figure). A global sink (often simply called ...