Search Results for ""

In the plane, if a line intersects one side of a triangle and misses the three vertices, then it must intersect one of the other two sides. This is a special case of the ...

The study of the probabilities involved in geometric problems, e.g., the distributions of length, area, volume, etc. for geometric objects under stated conditions. The ...

The idiosyncratic polynomial is the bivariate graph polynomial defined as the characteristic polynomial in x of A+y(J-I-A), where A is the adjacency matrix, J is the unit ...

A subgraph G^' of a graph G is a graph G^' whose vertex set and edge set are subsets of those of G. If G^' is a subgraph of G, then G is said to be a supergraph of G^' ...

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 ...

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 ...