Results 31 to 40 of about 64 (61)

Generalized Fibonacci Cubes

1993 International Conference on Parallel Processing - ICPP'93 Vol1, 1993
We present a new class of interconnection topolo gies called the generalized Fibonacci cubes (GFCs, for short) that encompass a range of networks such as the popular Boolean cube (hypercube) and the recent second-order Fibonacci cube in [5]. We show that each GFC has a recursive and self-similar structure and hence exhibits fault tolerant features.
W. J. Hsu, M. J. Chung
openaire   +1 more source

Generalized fibonacci cubes are mostly hamiltonian

Journal of Graph Theory, 1994
AbstractTheHamiltonian problemis to determine whether a graph contains a spanning (Hamiltonian) path or cycle. Here we study the Hamiltonian problem for thegeneralized Fibonacci cubes, which are a new family of graphs that have applications in interconnection topologies [J. Liuand W.‐J.
Liu, Jenshiuh   +2 more
openaire   +1 more source

On Generalized Fibonacci Cubes and Unitary Transforms

Applicable Algebra in Engineering, Communication and Computing, 1997
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Egiazarian, Karen, Astola, Jaakko
openaire   +2 more sources

Home - About - Disclaimer - Privacy