TOPICS
Search

Search Results for ""


1151 - 1160 of 1536 for Small-World Network Average PathSearch Results
A "weird number" is a number that is abundant (i.e., the sum of proper divisors is greater than the number) without being pseudoperfect (i.e., no subset of the proper ...
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 ...
A graph corresponding to the skeleton of one of the Archimedean solids. There are 13 Archimedean graphs, all of which are regular, planar, polyhedral, and Hamiltonian. The ...
When the index nu is real, the functions J_nu(z), J_nu^'(z), Y_nu(z), and Y_nu^'(z) each have an infinite number of real zeros, all of which are simple with the possible ...
Fuglede (1974) conjectured that a domain Omega admits an operator spectrum iff it is possible to tile R^d by a family of translates of Omega. Fuglede proved the conjecture in ...
There are a number of attractive polyhedron compounds consisting of five octahedra. The first octahedron 5-compound is a polyhedron compound composed of five octahedra ...
There are several related theorems involving Hamiltonian cycles of graphs that are associated with Pósa. Let G be a simple graph with n graph vertices. 1. If, for every k in ...
The Pratt certificate is a primality certificate based on Fermat's little theorem converse. Prior to the work of Pratt (1975), the Lucas-Lehmer test had been regarded purely ...
Any four mutually tangent spheres determine six points of tangency. A pair of tangencies (t_i,t_j) is said to be opposite if the two spheres determining t_i are distinct from ...
De Grey (2018) found the first examples of unit-distance graphs with chromatic number 5, thus demonstrating that the solution to the Hadwiger-Nelson problem (i.e., the ...
1 ... 113|114|115|116|117|118|119 ... 154 Previous Next

...