Search Results for ""

The Bron-Kerbosch algorithm is an efficient method for finding all maximal cliques in a graph.

The (lower) domination number gamma(G) of a graph G is the minimum size of a dominating set of vertices in G, i.e., the size of a minimum dominating set. This is equivalent ...

An axis is a line with respect to which a curve or figure is drawn, measured, rotated, etc. The most common axes encountered are commonly the mutually perpendicular Cartesian ...

Given a permutation {p_1,p_2,...,p_n} of {1,...,n}, the bumping algorithm constructs a standard Young tableau by inserting the p_i one by one into an already constructed ...

A leg of a right triangle (i.e., a side adjacent the right angle) is also known as a cathetus (plural: catheti). While this usage is rather rare in English, the terms ...

The intersection Fl of the Gergonne line and the Soddy line. In the above figure, D^', E^', and F^' are the Nobbs points, I is the incenter, Ge is the Gergonne point, and S ...

According to G. Pólya, the method of finding geometric objects by intersection. 1. For example, the centers of all circles tangent to a straight line s at a given point P lie ...

The perpendicular foot, also called the foot of an altitude, is the point on the leg opposite a given vertex of a triangle at which the perpendicular passing through that ...

Let the center B of a circle of radius a move along a line BA. Let O be a fixed point located a distance c away from AB. Draw a secant line through O and D, the midpoint of ...

The chromatic polynomial pi_G(z) of an undirected graph G, also denoted C(G;z) (Biggs 1973, p. 106) and P(G,x) (Godsil and Royle 2001, p. 358), is a polynomial which encodes ...