Search Results for ""
5021 - 5030 of 13135 for www.bong88.com login %...Search Results

The determination of whether a Turing machine will come to a halt given a particular input program. The halting problem is solvable for machines with less than four states. ...
Let Y_n denote the graph with vertex set V(X_n), where X_n is the n-hypercube and two vertices are adjacent in Y_n iff they are at distance 1<=d<=2 in X_n. Y_n is not ...
For a connected bipartite graph G, the halved graph G^+ and G^- are the two connected components of the distance 2-graph of G. The following table summarizes some named ...
The volumes of any n n-dimensional solids can always be simultaneously bisected by a (n-1)-dimensional hyperplane. Proving the theorem for n=2 (where it is known as the ...
A necessary and sufficient condition that there should exist at least one nondecreasing function alpha(t) such that mu_n=int_(-infty)^inftyt^ndalpha(t) for n=0, 1, 2, ..., ...
A basis for the real numbers R, considered as a vector space over the rationals Q, i.e., a set of real numbers {U_alpha} such that every real number beta has a unique ...
A graph G is Hamilton-connected if every two vertices of G are connected by a Hamiltonian path (Bondy and Murty 1976, p. 61). In other words, a graph is Hamilton-connected if ...
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 Hamilton decomposition (also called a Hamiltonian decomposition; Bosák 1990, p. 123) of a Hamiltonian regular graph is a partition of its edge set into Hamiltonian cycles. ...
A Hamiltonian cycle, also called a Hamiltonian circuit, Hamilton cycle, or Hamilton circuit, is a graph cycle (i.e., closed loop) through a graph that visits each node ...

...