Search Results for ""
11401 - 11410 of 13135 for bookSearch Results
A clique of a graph G is a complete subgraph of G, and the clique of largest possible size is referred to as a maximum clique (which has size known as the (upper) clique ...
The factorial n! is defined for a positive integer n as n!=n(n-1)...2·1. (1) So, for example, 4!=4·3·2·1=24. An older notation for the factorial was written (Mellin 1909; ...
A harmonic number is a number of the form H_n=sum_(k=1)^n1/k (1) arising from truncation of the harmonic series. A harmonic number can be expressed analytically as ...
The Heawood graph is a cubic graph on 14 vertices and 21 edges which is the unique (3,6)-cage graph. It is also a Moore graph. It has graph diameter 3, graph radius 3, and ...
The m×n knight graph is a graph on mn vertices in which each vertex represents a square in an m×n chessboard, and each edge corresponds to a legal move by a knight (which may ...
The angles mpi/n (with m,n integers) for which the trigonometric functions may be expressed in terms of finite root extraction of real numbers are limited to values of m ...
The constant e is base of the natural logarithm. e is sometimes known as Napier's constant, although its symbol (e) honors Euler. e is the unique number with the property ...
A (0,2)-graph is a connected graph such that any two vertices have 0 or 2 common neighbors. (0,2)-graphs are regular, and the numbers of (0,2)-graphs with vertex degree 0, 1, ...
The number two (2) is the second positive integer and the first prime number. It is even, and is the only even prime (the primes other than 2 are called the odd primes). The ...
257 is a Fermat prime, and the 257-gon is therefore a constructible polygon using compass and straightedge, as proved by Gauss. An illustration of the 257-gon is not included ...
...
View search results from all Wolfram sites (169407 matches)

