Search Results for ""

A graph in which individual nodes have no distinct identifications except through their interconnectivity. Graphs in which labels (which are most commonly numbers) are ...

The vertex triangle of two distinct circumcevian triangles or circumanticevian triangles is perspective to the reference triangle. In addition, the vertex triangles of the ...

If each of two curves meets the line at infinity in distinct, nonsingular points, and if all their intersections are finite, then if to each common point there is attached a ...

A weakly 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 ...

The Zeckendorf representation of a positive integer n is a representation of n as a sum of nonconsecutive distinct Fibonacci numbers, n=sum_(k=2)^Lepsilon_kF_k, where ...

A k-matrix is a kind of cube root of the identity matrix (distinct from the identity matrix) which is defined by the complex matrix k=[0 0 -i; i 0 0; 0 1 0]. It satisfies ...

Consider an infinite repository containing balls of n different types. Then the following table summarizes the number of distinct ways in which k balls can be picked for four ...

Find the maximum number of bishops B(n) that can be placed on an n×n chessboard such that no two attack each other. The answer is 2n-2 (Dudeney 1970, Madachy 1979), giving ...

An n-bridge knot is a knot with bridge number n. The set of 2-bridge knots is identical to the set of rational knots. If L is a 2-bridge knot, then the BLM/Ho polynomial Q ...

The chromatic polynomial pi_G(z) of an undirected graph G, also denoted C(G;z) (Biggs 1973, p. 106) and P(G,x) (Godsil and Royle 2001, p. 358), is a polynomial which encodes ...