./genPermutationGraphs -on 18 Generate all non-hamiltonian cycle permutation graphs of order 18 and send them to stdout. This is slightly slower than the previous method but faster than without -o. No ...

Abstract: We show that in an n-dimensional hypercube (Q/sub n/), up to n - 1 (resp. n $2) links can fail before destroying all available Hamiltonian paths (resp. cycles). We present an efficient ...

Hamiltonian Path: A path that visits each vertex in a graph exactly once. Hamiltonian Cycle: A cycle that visits each vertex in a graph exactly once and returns to the starting vertex.

In InIn this this this paper, paper, paper, wewewe show show show that that that the the the Fibonacci Fibonacci Fibonacci cubes cubes cubes with with with ananan even even even number number number ...

Taiwanese Journal of Mathematics, Vol. 10, No. 2, Special Issue: Proceedings of the International Conference on Analysis and Its Applications, 2004 (February 2006), pp. 327-338 (12 pages) In this note ...

Abstract: Constant increasing in the Indonesian population causes an increase in the electricity consumption, as well as the complexity in distribution system networks. Such complex networks require a ...