Results 61 to 70 of about 90 (77)
Some of the next articles are maybe not open access.
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, Moon-Jung Chung
openaire +1 more source
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, Moon-Jung Chung
openaire +1 more source
Generalized fibonacci cubes are mostly hamiltonian
Journal of Graph Theory, 1994AbstractTheHamiltonian 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.
Jen-Shiuh Liu +2 more
openaire +1 more source
Generalized Fibonacci cubes and trees for DSP applications
1996 IEEE International Symposium on Circuits and Systems. Circuits and Systems Connecting the World. ISCAS 96, 2002We 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
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
Recursive fault-tolerance of Fibonacci cube in hypercubes
Discrete Mathematics, 2006Petr Gregor
exaly
q-cube enumerator polynomial of Fibonacci cubes
Discrete Applied Mathematics, 2017Elif Saygi, Ömer Eğecioğlu
exaly
Cube Polynomial of Fibonacci and Lucas Cubes
Acta Applicandae Mathematicae, 2011Sandi Klavžar +2 more
exaly
The Diameter of Enhanced Extended Fibonacci Cube Interconnection Networks
Lecture Notes in Electrical Engineering, 2016Mufid Nilmada
exaly
On Generalized Fibonacci Quaternions and Fibonacci-Narayana Quaternions
Advances in Applied Clifford Algebras, 2013Cristina Flaut +2 more
exaly
Fibonacci Generalized Quaternions
Advances in Applied Clifford Algebras, 2014Hidayet Huda Kosal +2 more
exaly