Results 111 to 120 of about 180 (135)
Some of the next articles are maybe not open access.
On Generalized Fibonacci Cubes and Unitary Transforms
Applicable Algebra in Engineering, Communication and Computing, 1997zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Karen O. Egiazarian, Jaakko Astola
openaire +2 more sources
Recursive construction of hierarchical Fibonacci cubes and hierarchical extended Fibonacci cubes
Proceedings. Eighth International Conference on Parallel and Distributed Systems. ICPADS 2001, 2002Hierarchical Fibonacci cubes and hierarchical extended Fibonacci cubes are recursively constructed. This property comes from the point of these derived networks. These nets are basically derived from Fibonacci series, which are recursive series.
openaire +1 more source
2000
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
ARAGNO, EZIAMARIA, ZAGAGLIA, NORMA
openaire +2 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
ARAGNO, EZIAMARIA, ZAGAGLIA, NORMA
openaire +2 more sources
Mutual-Visibility in Fibonacci Cubes
Hypercubes, Butterfly and other well-structured topologies represent intriguing challenges in computer network architectures, especially for parallel and distributed computations. Within such a context, mutual-visibility plays a central role for communication activities.Alfredo Navarra, Francesco Piselli
openaire +3 more sources
Cube-Complements of Fibonacci and Lucas Cubes
Journal of Interconnection NetworksThe Fibonacci cube [Formula: see text] can be obtained from the hypercube [Formula: see text] by removing all vertices that contain [Formula: see text] as a substring, and the Lucas cube [Formula: see text] can be obtained from [Formula: see text] by removing all the vertices that have a circulation containing [Formula: see text].
Jianxin Wei, Yujun Yang
openaire +1 more source
On a problem on generalised Fibonacci cubes
Ars Comb., 2003Summary: A Fibonacci string of order \(n\) is a binary string of length \(n\) with no two consecutive ones. The Fibonacci cube \(\Gamma _n\) is the subgraph of the hypercube \(Q_n\) induced by the set of Fibonacci strings of order \(n\). For positive integers \(i,n\), with \(n \geq i\), the \(i\)th extended Fibonacci cube is the vertex induced subgraph
T. Hilberdink +2 more
openaire +2 more sources
Ars Combinatoria
In this paper, it is pointed out that the definition of `Fibonacci -cube’ in many papers (denoted by ) is incorrect. The graph is not the same as the original one (denoted by ) introduced by Egiazarian and Astola. First, it is shown that and have different recursive structure. Then, it is proven that all the graphs are partial cubes. However,
openaire +1 more source
In this paper, it is pointed out that the definition of `Fibonacci -cube’ in many papers (denoted by ) is incorrect. The graph is not the same as the original one (denoted by ) introduced by Egiazarian and Astola. First, it is shown that and have different recursive structure. Then, it is proven that all the graphs are partial cubes. However,
openaire +1 more source
New interconnection networks: Fibonacci cube and extended Fibonacci cubes based hierarchic networks
Proceedings 15th International Conference on Information Networking, 2002Ghose et al. (1995) developed interconnection networks which use hypercubes as the basic building blocks and Duh et al. (1995) used folded hypercubes as the basic building blocks to construct interconnection networks. We used the Fibonacci cube and extended Fibonacci cubes as the basic building blocks to construct new hierarchic interconnection ...
openaire +1 more source
Recursive fault-tolerance of Fibonacci cube in hypercubes
Discrete Mathematics, 2006Petr Gregor
exaly

