TOPICS
Search

Search Results for ""


5101 - 5110 of 8770 for Point Line Distance 3 DimensionalSearch Results
Cubic symmetric graphs are sometimes called Foster graphs and denoted F_(nnn)X, where nnn is the vertex count and X is a letter A, B, C, ... indicating the particular such ...
A dragon curve is a recursive nonintersecting curve whose name derives from its resemblance to a certain mythical creature. The curve can be constructed by representing a ...
A connected bipartite graph is called Hamilton-laceable, a term apparently introduced in Simmons (1978), if it has a u-v Hamiltonian path for all pairs of vertices u and v, ...
A weak snark is a cyclically 4-edge connected cubic graph with edge chromatic number 4 and girth at least 4 (Brinkmann et al. 2013). Weak snarks therefore represent a more ...
A matrix whose elements may contain complex numbers. The matrix product of two 2×2 complex matrices is given by (1) where R_(11) = ...
A problem posed by the Slovak mathematician Stefan Znám in 1972 asking whether, for all integers k>=2, there exist k integers x_1,...,x_k all greater than 1 such that x_i is ...
The edge multiplicity of a given end vertex in a multigraph is the number of multiple edges sharing that end vertex. The maximum edge multiplicity in such a graph is known as ...
Poisson's theorem gives the estimate (n!)/(k!(n-k)!)p^kq^(n-k)∼e^(-np)((np)^k)/(k!) for the probability of an event occurring k times in n trials with n>>1, p<<1, and np ...
A Poulet number whose divisors d all satisfy d|2^d-2. The first few are 341, 1387, 2047, 2701, 3277, 4033, 4369, 4681, 5461, 7957, 8321, ... (OEIS A050217).
The degree to which a given quantity is correct and free from error. For example, a quantity specified as 100+/-1 has an (absolute) accuracy of +/-1 (meaning its true value ...
1 ... 508|509|510|511|512|513|514 ... 877 Previous Next

...