Results 41 to 50 of about 64 (61)
Some of the next articles are maybe not open access.

Generalized Fibonacci cubes and trees for DSP applications

1996 IEEE International Symposium on Circuits and Systems. Circuits and Systems Connecting the World. ISCAS 96, 2002
We present a new interconnection topology called generalized Fibonacci cubes, which unifies a wide range of connection topologies such as the Boolean cube (or hypercube), classical Fibonacci cube, etc. We study the properties of generalized Fibonacci corresponding codes, e.g. we find an Zeckendorfs' theorem for the generalized Fibonacci codes.
K. Egiazarian, J. Astola
openaire   +1 more source

Cube-complements of generalized Fibonacci cubes

Discrete Mathematics, 2019
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

Embedding of generalized Fibonacci cubes in hypercubes with faulty nodes

IEEE Transactions on Parallel and Distributed Systems, 1997
The generalized Fibonacci cubes (abbreviated to GFCs) were recently proposed as a class of interconnection topologies, which cover a spectrum ranging from regular graphs such as the hypercube to semiregular graphs such as the second order Fibonacci cube.
Jiang, F. S., Horng, S. J., Kao, T. W.
openaire   +2 more sources

Isometric Sets of Words and Generalizations of the Fibonacci Cubes

The hypercube Q(n) is a graph whose 2(n) vertices can be associated to all binary words of length n in a way that adjacent vertices get words that differ only in one symbol. Given a word f, the subgraph Q(n)(f) is defined by selecting all vertices not containing f as a factor. A word f is said to be isometric if Q(n)(f) is an isometric subgraph of Q(n),
Anselmo M.   +5 more
openaire   +4 more sources

ZnO–CuO Core-Hollow Cube Nanostructures for Highly Sensitive Acetone Gas Sensors at the ppb Level

ACS Applied Materials & Interfaces, 2020
Jae Eun Lee, Chan Kyu Lim, Hyung Ju Park
exaly  

Home - About - Disclaimer - Privacy