Results 101 to 110 of about 180 (135)
Some of the next articles are maybe not open access.
Structure of Fibonacci cubes: a survey
Journal of Combinatorial Optimization, 2011zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Sandi Klavžar, Klavžar Sandi
exaly +2 more sources
Linear Recognition and Embedding of Fibonacci Cubes
Algorithmica, 2013zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Aleksander Vesel
exaly +3 more sources
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
The Computer Journal, 1996
We propose the enhanced Fibonacci cube (EFC) structure for parallel systems. It is defined based on the sequence F n = 2F n-2 + 2F n-4 . We show that the enhanced Fibonacci cube contains the Fibonacci cube (FC) as a subgraph and maintains virtually all the desirable properties of the Fibonacci cube. In addition, it is a Hamiltonian graph.
Haifeng Qian, Jie Wu 0001
openaire +1 more source
We propose the enhanced Fibonacci cube (EFC) structure for parallel systems. It is defined based on the sequence F n = 2F n-2 + 2F n-4 . We show that the enhanced Fibonacci cube contains the Fibonacci cube (FC) as a subgraph and maintains virtually all the desirable properties of the Fibonacci cube. In addition, it is a Hamiltonian graph.
Haifeng Qian, Jie Wu 0001
openaire +1 more source
The number of short cycles in Fibonacci cubes
Theoretical Computer Science, 2021zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ömer Egecioglu +2 more
openaire +3 more sources
Fast Recognition of Fibonacci Cubes
Algorithmica, 2007zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Andrej Taranenko, Aleksander Vesel
openaire +1 more source
The Irregularity Polynomials of Fibonacci and Lucas cubes
Bulletin of the Malaysian Mathematical Sciences Society, 2020zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ömer Eğecioğlu +2 more
openaire +2 more sources
On the sizes of extended Fibonacci cubes
IEEE Transactions on Parallel and Distributed Systems, 1999Hypercube is a popular interconnection network whose size must be a power of 2. Several interconnection networks have been proposed that do not suffer this limitation. Among them the extended Fibonacci cubes are based on the same sequence of the Fibonacci cubes and share many appealing structural properties.
openaire +2 more sources
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
International Journal of Mathematical Education in Science and Technology, 2006
Two visual proofs illustrating a cubic Fibonacci number identity are given. These provide a basis for further activities and consideration of the use of visual approaches to other identities.
openaire +2 more sources
Two visual proofs illustrating a cubic Fibonacci number identity are given. These provide a basis for further activities and consideration of the use of visual approaches to other identities.
openaire +2 more sources