All documents from essays.org are for research assistance purpose only. Do not present the material as your own work!
bookmark & share the essay...
Hamiltonicity of Hypercubes and Generalized Hypercubes
Parallel algorithm in computer CPU with accordance to Hypercubes.
|language || ||english
|wordcount || ||2515 (cca 7 pages)
|contextual quality || ||N/A
|language level || ||N/A
|price || ||free
|sources || ||3
Table of contents
Preview of the essay: Hamiltonicity of Hypercubes and Generalized Hypercubes
Hamiltonicity of Hypercubes and Generalized Hypercubes I. Introduction The traditional computer, often called a serial computer, executes one instruction at a time. The definition of algorithm, in this paper, assumes that one instruction is executed at a time. Such algorithms are called serial algorithms. Recently, it is feasible to build parallel computers, which have many processors that are capable of executing several instructions at a time. The associated algorithms are known as parallel algorithms. Many problems can be solved much faster using parallel computers rather than serial computers. One model for parallel computations is known as the n-cube or the hypercube. Hypercubes are special types of graphs. A graph G is an ordered triple (V(G), E(G), ...
... Thus, if k is odd then Qn,k is connected, n > k.
III. Hamiltonicity of the Generalized Hypercube Qn,k
Since Qn,k is connected if and only if k is odd and our concern is on the hamiltonicity of the generalized hypercube, Qn,k, then we only concentrate on the Qn,k’s where k is odd.
We state the next theorem without proof.
Theorem 12. Qn,k is hamiltonian if and only if n > k and k is odd.
Essay is in categories
This Hamiltonicity theory is really intriguing and interesting. I got a lot of insights in this essay.