Search Results for ""

Pairs of primes of the form (p, p+4) are called cousin primes. The first few are (3, 7), (7, 11), (13, 17), (19, 23), (37, 41), (43, 47), (67, 71), ... (OEIS A023200 and ...

For an undirected graph, an unordered pair of nodes that specify a line joining these two nodes are said to form an edge. For a directed graph, the edge is an ordered pair of ...

A plane image or pair of two-dimensional images that, when appropriately viewed using both eyes, produces an image which appears to be three-dimensional. By taking a pair of ...

The converse of Pascal's theorem, which states that if the three pairs of opposite sides of (an irregular) hexagon meet at three collinear points, then the six vertices lie ...

In the hyperbolic plane H^2, a pair of lines can be parallel (diverging from one another in one direction and intersecting at an ideal point at infinity in the other), can ...

Let L=(L, ^ , v ) be a lattice, and let f,g:L->L. Then the pair (f,g) is a polarity of L if and only if f is a decreasing join-endomorphism and g is an increasing ...

A strongly connected component of a simple directed graph (i.e., a digraph without loops) is a maximal subdigraph such that for every pair of distinct vertices u, v in the ...

Cospectral graphs, also called isospectral graphs, are graphs that share the same graph spectrum. The smallest pair of isospectral graphs is the graph union C_4 union K_1 and ...

Let P be a point with trilinear coordinates alpha:beta:gamma=f(a,b,c):f(b,c,a):f(c,ab) and P^' be a point with trilinear coordinates ...

A group of four elements, also called a quadruplet or tetrad.