Search Results for ""

The Lucas central triangle (a term coined here for the first time) is the triangle DeltaL_AL_BL_C formed by the centers of the Lucas circles of a given reference triangle ...

A k-matching in a graph G is a set of k edges, no two of which have a vertex in common (i.e., an independent edge set of size k). Let Phi_k be the number of k-matchings of ...

The (26,8)-Paulus graph having the largest possible graph automorphism group order of all 26-node Paulus graphs (namely 120) is sometimes known as the ...

The problem in calculus of variations to find the minimal surface of a boundary with specified constraints (usually having no singularities on the surface). In general, there ...

A prime ideal is an ideal I such that if ab in I, then either a in I or b in I. For example, in the integers, the ideal a=<p> (i.e., the multiples of p) is prime whenever p ...

A tree having four branches at each node. Quadtrees are used in the construction of some multidimensional databases (e.g., cartography, computer graphics, and image ...

A quasi-cubic graph is a quasi-regular graph, i.e., a graph such that degree of every vertex is the same delta except for a single vertex whose degree is Delta=delta+1 ...

There are nine possible types of isolated singularities on a cubic surface, eight of them rational double points. Each type of isolated singularity has an associated normal ...

A closed planar quadrilateral with opposite sides of equal lengths a and b, and with four right angles. A square is a degenerate rectangle with a=b. The area of the rectangle ...

The word "star" is used in a number of different ways in mathematics. The term is commonly used to voice an asterisk when appearing in a mathematical expression. For example, ...