Recursive fault-tolerance of Fibonacci cube in hypercubes
From MaRDI portal
Publication:2497470
Recommendations
Cites work
- scientific article; zbMATH DE number 1759412 (Why is no real title available?)
- Largest induced subgraphs of the n-cube that contain no 4-cycles
- On the Lucas cubes
- Parallel tree contraction and prefix computations on a large family of interconnection topologies
- Structural and enumerative properties of the Fibonacci cubes
- Subcube fault-tolerance in hypercubes
- The observability of the Fibonacci and the Lucas cubes
- Widened Fibonacci cubes
Cited in
(15)- Some Turán type results on the hypercube
- Fault-tolerant algorithm for Fast Fourier Transform on hypercubes
- Structure of Fibonacci cubes: a survey
- Enumerative properties and cube polynomials of Tribonacci cubes
- The degree sequence of Fibonacci and Lucas cubes
- All good (bad) words consisting of 5 blocks
- The structures of bad words
- scientific article; zbMATH DE number 1759412 (Why is no real title available?)
- Proofs of two conjectures on generalized Fibonacci cubes
- On the domination number and the 2-packing number of Fibonacci cubes and Lucas cubes
- Asymptotic number of isometric generalized Fibonacci cubes
- Generalized Fibonacci cubes
- Cube polynomial of Fibonacci and Lucas cubes
- Reliability analysis and fault tolerance for hypercube multi-computer networks
- The eccentricity sequences of Fibonacci and Lucas cubes
This page was built for publication: Recursive fault-tolerance of Fibonacci cube in hypercubes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2497470)