Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 241,163,687 papers from all fields of science
Search
Sign In
Create Free Account
Fibonacci cube
The Fibonacci cubes or Fibonacci networks are a family of undirected graphs with rich recursive properties derived from its origin in number theory…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
16 relations
Chemical graph theory
Clique (graph theory)
Complement graph
Hamiltonian path
Expand
Broader (1)
Network topology
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Perfect codes in generalized Fibonacci cubes
M. Mollard
2018
Corpus ID: 119131462
The {\em Fibonacci cube} of dimension $n$, denoted as $\Gamma\_n$, is the subgraph of the $n$-cube $Q\_n$ induced by vertices…
Expand
2017
2017
TOPOLOGI JARINGAN INTERKONEKSI KOMPUTER BARU: ENHANCED-EXTENDED FIBONACCI CUBE (E2FC)
Mufid Nilmada
2017
Corpus ID: 125131654
Mufid Nilmada,99213713 (xvi+84+Lampiran) Salah satu problem mendasar dalam komputasi paralel adalah perancangan topologi jaringan…
Expand
2013
2013
Linear Recognition and Embedding of Fibonacci Cubes
A. Vesel
Algorithmica
2013
Corpus ID: 253977206
Fibonacci strings are binary strings that contain no two consecutive 1s. The Fibonacci cube Γh is the subgraph of the h-cube…
Expand
2009
2009
ON THE FIBONACCI DIMENSION OF PARTIAL CUBES
A. Vesel
2009
Corpus ID: 14920058
The Fibonacci dimension fdim(G) of a graph G was introduced in [7] as the smallest integer d such that G admits an isometric…
Expand
2007
2007
On embedding Fibonacci meshes on Fibonacci cube networks
Ioana Zelina
2007
Corpus ID: 102505223
The Fibonacci cube was presented as a new topology for interconnection networks. Due to his strong recursive structure, the…
Expand
2007
2007
Fault-tolerant analysis of extended Fibonacci cube
Mian Jiang
2007
Corpus ID: 123196345
In this paper,that k-1 Fault-tolerant diameter and k width diameter of extended Fibonacci cubes are both n-1 for k=[n/3]is proved…
Expand
2007
2007
On Restricted Edge Connectivity and Extra Edge Connectivity of Extended Fibonacci Cube
Qiao Li
2007
Corpus ID: 124722472
In this paper,we prove that 1-restricted edge connectivity and 1-extra edge connectivity of Extended Fibonacci Cubes are 2[n/3]-2…
Expand
2005
2005
PARALLEL LAGRANGE INTERPOLATION ON EXTENDED FIBONACCI CUBES
Ioana Zelina
2005
Corpus ID: 1528384
In this paper is presented a parallel algorithm for computing a Lagrange interpolation on a Extended Fibonacci Cube EFC1(n):The…
Expand
1997
1997
Embedding of Generalized Fibonacci Cubes in Hypercubes with Faulty Nodes
Feng-Shr Jiang
,
S. Horng
,
T. Kao
IEEE Trans. Parallel Distributed Syst.
1997
Corpus ID: 35262356
The generalized Fibonacci cubes (abbreviated to GFCs) were recently proposed as a class of interconnection topologies, which…
Expand
1992
1992
Parallel Contraction of Fibonacci Trees and Prefix Computations on a Family of Interconnection Topologies
Wen-Jing Hsu
,
C. V. Page
,
Jen-Shiuh Liu
Colloquium on Trees in Algebra and Programming
1992
Corpus ID: 13427773
The computation of prefixes of a given sequence (prefix computation [14]) and the fast reduction of a tree to a single node (tree…
Expand