Search Results for ""

A n-dipyramidal graph is the skeleton of an n-sided dipyramid. It is isomorphic to the (m,2)-cone graph C_m+K^__2, where C_m is a cycle graph, K^__2 is the empty graph on 2 ...

Each of the sets forming a direct product is said to be a direct factor. A group G is said to be a direct factor of the group G^' if G^' is isomorphic to the group direct ...

The direct limit, also called a colimit, of a family of R-modules is the dual notion of an inverse limit and is characterized by the following mapping property. For a ...

Direct search factorization is the simplest (and most simple-minded) prime factorization algorithm. It consists of searching for factors of a number by systematically ...

A directed strongly regular graph is a simple directed graph with adjacency matrix A such that the span of A, the identity matrix I, and the unit matrix J is closed under ...

Let a be the angle between v and x, b the angle between v and y, and c the angle between v and z. Then the direction cosines are equivalent to the (x,y,z) coordinates of a ...

A series suma(n)e^(-lambda(n)z), where a(n) and z are complex and {lambda(n)} is a monotonic increasing sequence of real numbers. The numbers lambda(n) are called the ...

A.k.a. the pigeonhole principle. Given n boxes and m>n objects, at least one box must contain more than one object. This statement has important applications in number theory ...

A graph G is said to be disconnected if it is not connected, i.e., if there exist two nodes in G such that no path in G has those nodes as endpoints. The numbers of ...

A topological space that is not connected, i.e., which can be decomposed as the disjoint union of two nonempty open subsets. Equivalently, it can be characterized as a space ...