Search Results for ""

The upper domination number Gamma(G) of a graph G is the maximum size of a minimal dominating set of vertices in G. The (lower) domination number may be similarly defined as ...

The upper irredundance number IR(G) of a graph G is the maximum size of an irredundant set of vertices in G. It is therefore equal to the size of a maximum irredundant set as ...

If the cross ratio kappa of {AB,CD} satisfy kappa^2-kappa+1=0, (1) then the points are said to form a bivalent range, and {AB,CD}={AC,DB}={AD,BC}=kappa (2) ...

A polyhedron is said to be canonical if all its polyhedron edges touch a sphere and the center of gravity of their contact points is the center of that sphere. In other ...

All closed surfaces, despite their seemingly diverse forms, are topologically equivalent to spheres with some number of handles or cross-caps. The traditional proof follows ...

The contact angle between a sphere and a tangent plane is the angle alpha between the normal to the sphere at the point of tangency and the basal plane with respect to which ...

A standard form of the linear programming problem of maximizing a linear function over a convex polyhedron is to maximize c·x subject to mx<=b and x>=0, where m is a given ...

Let P=p:q:r and U=u:v:w be distinct points, neither lying on a side line of the reference triangle DeltaABC. Then the P-cross conjugate of U is the point ...

For vectors u=(u_x,u_y,u_z) and v=(v_x,v_y,v_z) in R^3, the cross product in is defined by uxv = x^^(u_yv_z-u_zv_y)-y^^(u_xv_z-u_zv_x)+z^^(u_xv_y-u_yv_x) (1) = ...

If P=p:q:r and U=u:v:w are distinct trilinear points, neither lying on a sideline of the reference triangle DeltaABC, then the crosspoint of P and U is the point ...