TOPICS
Search

Search Results for ""


1541 - 1550 of 2690 for Heawood Four Color GraphSearch Results
Combinatorics is the branch of mathematics studying the enumeration, combination, and permutation of sets of elements and the mathematical relations that characterize their ...
In discrete percolation theory, bond percolation is a percolation model on a regular point lattice L=L^d in d-dimensional Euclidean space which considers the lattice graph ...
A d-dimensional discrete percolation model is said to be inhomogeneous if different graph edges (in the case of bond percolation models) or vertices (in the case of site ...
A state diagram is a labeled directed graph together with state information that can be used to indicate that certain paths on in a system may be traversed only in a certain ...
For a given positive integer n, does there exist a weighted tree with n graph vertices whose paths have weights 1, 2, ..., (n; 2), where (n; 2) is a binomial coefficient? ...
The shortest circular sequence of length sigma^n such that every string of length n on the alphabet a of size sigma occurs as a contiguous subrange of the sequence described ...
The nth Beraha constant (or number) is given by B(n)=2+2cos((2pi)/n). B(5) is phi+1, where phi is the golden ratio, B(7) is the silver constant, and B(10)=phi+2. The ...
The base 16 notational system for representing real numbers. The digits used to represent numbers using hexadecimal notation are 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, A, B, C, D, E, ...
A quadrilateral in which a pair of opposite sides have the same length and are inclined at 60 degrees to each other (or equivalently, satisfy <A>+<B>=120 degrees). Some ...
An apodization function chosen to minimize the height of the highest sidelobe (Hamming and Tukey 1949, Blackman and Tukey 1959). The Hamming function is given by ...
1 ... 152|153|154|155|156|157|158 ... 269 Previous Next

...