Results 101 to 110 of about 173 (142)
Some of the next articles are maybe not open access.

Fibonacci cubes

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

Enhanced Fibonacci Cubes

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.
openaire   +1 more source

Generalized fibonacci cubes are mostly hamiltonian

Journal of Graph Theory, 1994
AbstractTheHamiltonian 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.
Liu, Jenshiuh   +2 more
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

Edge-counting vectors, Fibonacci cubes, and Fibonacci triangle

Publicationes Mathematicae Debrecen, 2007
Edge-counting vectors of subgraphs of Cartensian products are introduced as the counting vectors of the edges that project onto the factors. For several standard constructions their edge-counting vectors are computed. It is proved that the edge-counting vectors of Fibonacci cubes are the rows of the Fibonacci triangle, and the edge-counting vectors of ...
Klavžar, Sandi, Peterin, Iztok
openaire   +2 more sources

About the cube polynomial of Extended Fibonacci Cubes

Creative Mathematics and Informatics, 2018
The hypercube is one of the best model for the network topology of a distributed system. In this paper we determine the cube polynomial of Extended Fibonacci Cubes, which is the counting polynomial for the number of induced k-dimensional hypercubes in Extended Fibonacci Cubes.
Ioana Zelina   +2 more
openaire   +1 more source

Recursive construction of hierarchical Fibonacci cubes and hierarchical extended Fibonacci cubes

Proceedings. Eighth International Conference on Parallel and Distributed Systems. ICPADS 2001, 2002
Hierarchical 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

The Irregularity Polynomials of Fibonacci and Lucas cubes

Bulletin of the Malaysian Mathematical Sciences Society, 2020
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ömer Eğecioğlu   +2 more
openaire   +2 more sources

On Generalized Fibonacci Cubes and Unitary Transforms

Applicable Algebra in Engineering, Communication and Computing, 1997
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Egiazarian, Karen, Astola, Jaakko
openaire   +2 more sources

Widened Fibonacci cubes

2000
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
ARAGNO, EZIAMARIA, ZAGAGLIA, NORMA
openaire   +2 more sources

Home - About - Disclaimer - Privacy