Search Results for ""

A node in a graph for which the graph eccentricity equals the graph diameter (Harary 1994, p. 41).

A matching, also called an independent edge set, on a graph G is a set of edges of G such that no two sets share a vertex in common. It is not possible for a matching on a ...

Let a straight line AB be divided internally at C and externally at D in the same ratio, so that (AC)/(CB)=-(AD)/(DB). Then AB is said to be divided harmonically at C and D ...

For a finite group G, let p(G) be the subgroup generated by all the Sylow p-subgroups of G. If X is a projective curve in characteristic p>0, and if x_0, ..., x_t are points ...

A real vector bundle pi:E->M has an orientation if there exists a covering by trivializations U_i×R^k such that the transition functions are vector space ...

The circular points at infinity, also called the isotropic points, are the pair of (complex) points on the line at infinity through which all circles pass. The circular ...

A compactification of a topological space X is a larger space Y containing X which is also compact. The smallest compactification is the one-point compactification. For ...

The directrix of a conic section is the line which, together with the point known as the focus, serves to define a conic section as the locus of points whose distance from ...

An n-dimensional disk (sometimes spelled "disc") of radius r is the collection of points of distance <=r (closed disk) or <r (open disk) from a fixed point in Euclidean ...

Given a triangle DeltaABC, construct the contact triangle DeltaDEF. Then the Nobbs points are the intersections of the corresponding sides of triangles DeltaABC and DeltaDEF, ...