Search Results for ""

The union G=G_1 union G_2 of graphs G_1 and G_2 with disjoint point sets V_1 and V_2 and edge sets X_1 and X_2 is the graph with V=V_1 union V_2 and X=X_1 union X_2 (Harary ...

The Jørgensen graph is a maximally linklessly embeddable graph on 8 vertices and 21 edges, where "maximal" means it is not a proper subgraph of another linklessly embeddable ...

A stem-and-leaf diagram, also called a stem-and-leaf plot, is a diagram that quickly summarizes data while maintaining the individual data points. In such a diagram, the ...

The study of efficient algorithms for solving geometric problems. Examples of problems treated by computational geometry include determination of the convex hull and Voronoi ...

A process of successively crossing out members of a list according to a set of rules such that only some remain. The best known sieve is the sieve of Eratosthenes for ...

An entire function f is said to be of finite order if there exist numbers a,r>0 such that |f(z)|<=exp(|z|^a) for all |z|>r. The infimum of all numbers a for which this ...

If a subset S of the elements of a field F satisfies the field axioms with the same operations of F, then S is called a subfield of F. In a finite field of field order p^n, ...

The complete products of a Boolean algebra of subsets generated by a set {A_k}_(k=1)^p of cardinal number p are the 2^p Boolean functions B_1B_2...B_p=B_1 intersection B_2 ...

A positive integer: 1, 2, 3, 4, ... (OEIS A000027), also called a natural number. However, zero (0) is sometimes also included in the list of counting numbers. Due to lack of ...

The bipartite double graph, also called the Kronecker cover, Kronecker double cover, bipartite double cover, canonical double cover, or bipartite double, of a given graph G ...